Title :
Optimized arithmetic for Reed-Solomon encoders
Author_Institution :
ECE Dept., Worcester Polytech. Inst., MA, USA
fDate :
29 Jun-4 Jul 1997
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;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613165
