论文信息 - Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding

Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding

Cyclotomic fast Fourier transform (CFFT) was recently proposed and shown to be efficient for lengths up to 511. In this paper, we propose a novel algorithm to reduce the additive complexity of CFFT. When used in transform-domain Reed-Solomon decoders, our improved CFFT reduces the complexity of the transform portion by up to 72%.

Ning Chen | Zhiyuan Yan | Ning Chen | Zhiyuan Yan

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

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

[3] Trieu-Kien Truong,et al. Fast transform for decoding both errors and erasures of Reed-Solomon codes over GF(2/sup m/) for 8/spl les/m/spl les/10 , 2006, IEEE Transactions on Communications.

[4] K. Steiglitz,et al. Some complexity issues in digital signal processing , 1984 .

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

[6] Richard E. Blahut. Transform Techniques for Error Control Codes , 1979, IBM J. Res. Dev..

[7] T. C. Cheng,et al. Fast Transform for Decoding Both Errors and Erasures of Reed – Solomon Codes Over GF ( 2 m ) for 8 m 10 , 2006 .

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

[9] Berk Sunar,et al. Mastrovito Multiplier for All Trinomials , 1999, IEEE Trans. Computers.

[10] Athar Mahboob,et al. Lookup table based multiplication technique for GF(2m) with cryptographic significance , 2005 .

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