High-speed and low-power split-radix FFT
Authors:
- Chein-Wei JenCJChein-Wei Jen
- 19 February 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 51 (3) , 864-874
Abstract
This paper presents a novel split-radix fast Fourier transform (SRFFT) pipeline architecture design. A mapping methodology has been developed to obtain regular and modular pipeline for split-radix algorithm. The pipeline is repartitioned to balance the latency between complex multiplication and butterfly operation by using carry-save addition. The number of complex multiplier is minimized via a bit-inverse and bit-reverse data scheduling scheme. One can also apply the design methodology described here to obtain regular and modular pipeline for the other Cooley-Tukey-based algorithms. For an N(= 2/sup n/)-point FFT, the requirements are log/sub 4/ N - 1 multipliers, 4log/sub 4/ N complex adders, and memory of size N - 1 complex words for data reordering. The initial latency is N + 2 /spl middot/ log/sub 2/ N clock cycles. On the average, it completes an N-point FFT in N clock cycles. From post-layout simulations, the maximum clock rate is 150 MHz (75 MHz) at 3.3 V (2.7 V), 25/spl deg/C (100/spl deg/C) using a 0.35-/spl mu/m cell library from Avant!. A 64-point SRFFT pipeline design has been implemented and consumes 507 mW at 100 MHz, 3.3 v, and 25/spl deg/C. Compared with a radix-2/sup 2/ FFT implementation, the power consumption is reduced by an amount of 15%, whereas the speed is improved by 14.5%.Keywords
This publication has 17 references indexed in Scilit:
- Designing pipeline FFT processor for OFDM (de)modulation2002
- Design of a 100 Mbps wireless local area network2002
- A complex-number multiplier using radix-4 digits2002
- A pipelined FFT processor for word-sequential dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Pipeline and Parallel-Pipeline FFT Processors for VLSI ImplementationsIEEE Transactions on Computers, 1984
- Fourier Transform Computers Using CORDIC IterationsIEEE Transactions on Computers, 1974
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961
- A SIGNED BINARY MULTIPLICATION TECHNIQUEQuarterly Journal of Mechanics and Applied Mathematics, 1951