• DocumentCode
    3039729
  • Title

    Optimized arithmetic for Reed-Solomon encoders

  • Author

    Paar, Christof

  • Author_Institution
    ECE Dept., Worcester Polytech. Inst., MA, USA
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    250
  • Abstract
    Multiplication with constant elements from Galois fields GF(2n) is the major arithmetic operation in Reed-Solomon encoders. This contribution describes two optimization algorithms which yield low complexity constant multipliers
  • Keywords
    Galois fields; Reed-Solomon codes; arithmetic codes; computational complexity; matrix multiplication; optimisation; Galois fields; Reed-Solomon encoders; arithmetic operation; low complexity constant multipliers; multiplication; optimization algorithms; optimized arithmetic; Arithmetic; Cost function; Equations; Feedback; Galois fields; Reed-Solomon codes; Shift registers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1997.613165
  • Filename
    613165
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3039729