IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 2011 · 195 citations · 31 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingDigital Signal ProcessingFourier AnalysisHardware AccelerationParallel ArchitecturesParallel Computer ArchitecturePipeline ParallelismComplexityDigital Signal Processing Block ArchitectureDigital Signal Processing BlocksFast Fourier TransformFourier TransformParallel Computing ArchitecturesParallel Fast Fourier TransformsParallel Processing Architectures
This paper presents a novel approach to develop parallel pipelined architectures for the fast Fourier transform (FFT). A formal procedure for designing FFT architectures using folding transformation and register minimization techniques is proposed. Novel parallel-pipelined architectures for the computation of complex and real valued fast Fourier transform are derived. For complex valued Fourier transform (CFFT), the proposed architecture takes advantage of under utilized hardware in the serial architecture to derive <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$L$</tex></formula> -parallel architectures without increasing the hardware complexity by a factor of <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">$L$</tex></formula> . The operating frequency of the proposed architecture can be decreased which in turn reduces the power consumption. Further, this paper presents new parallel-pipelined architectures for the computation of real-valued fast Fourier transform (RFFT). The proposed architectures exploit redundancy in the computation of FFT samples to reduce the hardware complexity. A comparison is drawn between the proposed designs and the previous architectures. The power consumption can be reduced up to 37% and 50% in 2-parallel CFFT and RFFT architectures, respectively. The output samples are obtained in a scrambled order in the proposed architectures. Circuits to reorder these scrambled output sequences to a desired order are presented.
31
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
Signal modeling techniques in speech recognition
J. Picone · Proceedings of the IEEE · 1993 · 764 citations
Computing, Linguistics, Phonetics +13
A new approach to pipeline FFT processor
Shousheng He, M. Torkelson · 2002 · 372 citations