Title :
Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding
Author :
Chen, Ning ; Yan, Zhiyuan
Author_Institution :
Department of Electrical and Computer Engineering, Lehigh University, PA 18015, USA, E-mail: nic6@lehigh.edu
Abstract :
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%.
Keywords :
Application software; Decoding; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Galois fields; Matrix decomposition; Polynomials; Reed-Solomon codes; Symmetric matrices; Complexity theory; Discrete Fourier transforms; Galois fields; Optimization; Reed-Solomon codes;
Conference_Titel :
Signal Processing Systems, 2007 IEEE Workshop on
Conference_Location :
Shanghai, China
Print_ISBN :
978-1-4244-1222-8
Electronic_ISBN :
1520-6130
DOI :
10.1109/SIPS.2007.4387627
