A pipelined architecture for normal I/O order FFT

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.

[1]  Alvin M. Despain,et al.  Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations , 1984, IEEE Transactions on Computers.

[2]  Hsi-Chin Hsin,et al.  Low-power and high-speed CORDIC-based split-radix FFT processor for OFDM systems , 2010, Digit. Signal Process..

[3]  Keshab K. Parhi,et al.  A Pipelined FFT Architecture for Real-Valued Signals , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[4]  W. Stewart.  Joseph , 2002, The Psychological clinic.

[5]  Keshab K. Parhi,et al.  High-Throughput VLSI Architecture for FFT Computation , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[6]  Chen-Yi Lee,et al.  A 1-GS/s FFT/IFFT processor for UWB applications , 2005, IEEE J. Solid State Circuits.

[7]  Yun-Nan Chang,et al.  An Efficient VLSI Architecture for Normal I/O Order Pipeline FFT Design , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  T. Sansaloni,et al.  Efficient pipeline FFT processors for WLAN MIMO-OFDM systems , 2005 .

[9]  C. K. Yuen,et al.  Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  E.E. Swartzlander,et al.  A radix 4 delay commutator for fast Fourier transform processor implementation , 1984, IEEE Journal of Solid-State Circuits.

[11]  J. F. Sevillano,et al.  Radix $r^{k} $ FFTs: Matricial Representation and SDC/SDF Pipeline Implementation , 2009, IEEE Transactions on Signal Processing.

[12]  Alvin M. Despain,et al.  Fourier Transform Computers Using CORDIC Iterations , 1974, IEEE Transactions on Computers.

[13]  Guy Godin,et al.  Gold , 1895, The Hospital.

[14]  E. V. Jones,et al.  A pipelined FFT processor for word-sequential data , 1989, IEEE Trans. Acoust. Speech Signal Process..

[15]  Chein-Wei Jen,et al.  High-speed and low-power split-radix FFT , 2003, IEEE Trans. Signal Process..

[16]  Jung-yeol Oh,et al.  Area and power efficient pipeline FFT algorithm , 2005, IEEE Workshop on Signal Processing Systems Design and Implementation, 2005..

[17]  Mats Torkelson,et al.  A new approach to pipeline FFT processor , 1996, Proceedings of International Conference on Parallel Processing.