Reduced-complexity Reed-Solomon decoders based on cyclotomic FFTs

IEEE Signal Processing Letters

Volumn 16, Issue 4, 2009, Pages 280-283

  Chen, Ning ^a   Yan, Zhiyuan ^a  

^a Lehigh University   (United States)

Author keywords

Common subexpression elimination (CSE); Decoding; Discrete Fourier transforms; Galois fields; Reed Solomon codes

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; REED-SOLOMON CODES;

COMMON SUBEXPRESSION ELIMINATION; COMMON SUBEXPRESSION ELIMINATION ALGORITHM; COMPLEXITY REDUCTION; GALOIS FIELDS; REDUCED COMPLEXITY; REED SOLOMON DECODER; TIME DOMAIN;

DISCRETE FOURIER TRANSFORMS;

EID: 78649336097     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2009.2014292     Document Type: Article

References (12)

1. R. E. Blahut, Theory and Practice of Error Contml Codes. Reading, MA: Addison-Wesley, 1983.
2. J. H. Jeng and T. K. Truong, "On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm," IEEE Tmns. Commun., vol. 47, no. 10, pp. 1488-1494, Oct. 1999.
3. E. Costa, S. V. Fedorenko, and P. V. Trifonov, "On computing the syndrome polynomial in Reed-Solomon decoder," Euro. Trans. Telecom, vol. 15, no. 4, pp. 337-342, 2004 [Online], Available: http://dcn.infos.ru/~petert/ papers/syndromes-ett.pdf
4. m)for8 < m < 10,"IEEE Trans. Commun., vol.54, no. 2,pp. 181-186, Feb. 2006.
5. T.-C. Lin, T. K. Truong, and P. D. Chen, "A fast algorithm for the syndrome calculation in algebraic decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 55, no. 12, pp. 1-5, Dec. 2007.
6. S. V. Fedorenko, "A method of computation of the discrete Fourier transform over a finite field," Probl. Inf. Transm., vol. 42, no. 2, pp. 139-151,2006.
7. S. V. Fedorenko and P. V. Trifonov, "Finding roots of polynomials over finite fields," IEEE Trans. Commun., vol. 50, no. 11, pp. 1709-1711, Nov. 2002.
8. T. K. Truong, J. H. Jeng, and I. S. Reed, "Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders," IEEE Trans. Commun., vol. 49, no. 5, pp. 779-783, May 2001.
9. P. V. Trifonov and S. V. Fedorenko, "A method for fast computation of the Fourier transform over a finite field," Probl. Inf. Transm. vol. 39, no. 3, pp. 231-238, 2003 [Online], Available: http://dcn.infos.ru/ -peteit/papers/fftEng.pdf
10. N. Chen and Z. Yan, "Cyclotomic FFTs with reduced additive complexity using a novel common subexpression elimination algorithm," IEEE Tmns. Signal Process. [Online]. Available: http://arxiv.org/abs/ 0710.1879
11. T. G. Zakharova, "Fourier transform evaluation in fields of characteristic 2," Probl. Inf. Transm., vol. 28, no. 2, pp. 154-167, 1992.
12. N. Chen and Z. Yan, "Reduced-complexity Reed-Solomon decoders based on cyclotomic FFTs," IEEE Signal Process. Lett. [Online]. Available: http://arxiv.org/abs/0811.0196