A pipelined architecture for normal I/O order FFT
Authors:
- 29 January 2011
- journal article
- Published by Zhejiang University Press in Journal of Zhejiang University SCIENCE C
- Vol. 12 (1) , 76-82
Abstract
We present a novel pipelined fast Fourier transform (FFT) architecture which is capable of producing the output sequence in normal order. A single-path delay commutator processing element (SDC PE) has been proposed for the first time. It saves a complex adder compared with the typical radix-2 butterfly unit. The new pipelined architecture can be built using the proposed processing element. The proposed architecture can lead to 100% hardware utilization and 50% reduction in the overall number of adders required in the conventional pipelined FFT designs. In order to produce the output sequence in normal order, we also present a bit reverser, which can achieve a 50% reduction in memory usage.Keywords
This publication has 14 references indexed in Scilit:
- A Pipelined FFT Architecture for Real-Valued SignalsIEEE Transactions on Circuits and Systems I: Regular Papers, 2009
- Radix $r^{k} $ FFTs: Matricial Representation and SDC/SDF Pipeline ImplementationIEEE Transactions on Signal Processing, 2009
- An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT DesignIEEE Transactions on Circuits and Systems II: Express Briefs, 2008
- High-Throughput VLSI Architecture for FFT ComputationIEEE Transactions on Circuits and Systems II: Express Briefs, 2007
- Area and power efficient pipeline FFT algorithm2006
- Efficient pipeline FFT processors for WLAN MIMO-OFDM systemsElectronics Letters, 2005
- A 1-GS/s FFT/IFFT processor for UWB applicationsIEEE Journal of Solid-State Circuits, 2005
- A new approach to pipeline FFT processor1996
- A pipelined FFT processor for word-sequential dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Fourier Transform Computers Using CORDIC IterationsIEEE Transactions on Computers, 1974