Reduced-Complexity Decoders of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms

Long Reed-Solomon (RS) codes are desirable for digital communication and storage systems due to their improved error performance, but the high computational complexity of their decoders is a key obstacle to their adoption in practice. As discrete Fourier transforms (DFTs) can evaluate a polynomial at multiple points, efficient DFT algorithms are promising in reducing the computational complexities of syndrome based decoders for long RS codes. In this correspondence, we first propose partial composite cyclotomic Fourier transforms (CCFTs) and then devise syndrome based decoders for long RS codes over large finite fields based on partial CCFTs. The new decoders based on partial CCFTs achieve a significant saving of computational complexities for long RS codes. In comparison to previous results based on Horner's rule, our hardware implementation for a (2720, 2550) shortened RS code over GF(212) achieves much higher throughputs and better area-time complexity.

[1]  Elena Costa,et al.  On computing the syndrome polynomial in Reed-Solomon decoder , 2004, Eur. Trans. Telecommun..

[2]  Seungjune Jeon,et al.  Performance and Complexity of 32 k-bit Binary LDPC Codes for Magnetic Recording Channels , 2010, IEEE Transactions on Magnetics.

[3]  L. J. Wang,et al.  Fast, prime factor, discrete Fourier transform , 2004 .

[4]  Sergei V. Fedorenko.  A method for computation of the discrete Fourier transform over a finite field , 2006, Probl. Inf. Transm..

[5]  Ning Chen,et al.  Cyclotomic FFTs With Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm , 2007, IEEE Transactions on Signal Processing.

[6]  Peter Trifonov,et al.  A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..

[7]  Ying Wang,et al.  Composite Cyclotomic Fourier Transforms With Reduced Complexities , 2010, IEEE Transactions on Signal Processing.

[8]  R. Blahut.  Theory and practice of error control codes , 1983 .

[9]  Ning Chen,et al.  Reduced-Complexity Reed–Solomon Decoders Based on Cyclotomic FFTs , 2009, IEEE Signal Processing Letters.

[10]  Framing structure , channel coding and modulation for digital terrestrial television , 2022 .

[11]  Trieu-Kien Truong,et al.  Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8 leq m leq 10 , 2006, Inf. Sci..

[12]  T. Buerner,et al.  On a high-speed Reed-Solomon Codec architecture for 43 Gb/s optical transmission systems , 2004, 2004 24th International Conference on Microelectronics (IEEE Cat. No.04TH8716).

[13]  William E. Ryan,et al.  Dual-mode decoding of product codes with application to tape storage , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[14]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[15]  M. Hassner,et al.  Hard Disk Drive Long Data Sector White Paper , 2007 .

[16]  Irving John Good,et al.  The Interaction Algorithm and Practical Fourier Analysis , 1958 .