A VLSI-oriented FFT algorithm and its pipelined design

This paper presents a novel FFT algorithm based on a multi-dimensional index mapping method. Twiddle factor multiplications are decomposed in a divide and conquer approach to minimize the number of multipliers and remain the simpleness of the butterfly computation. And canonic signed digit representation is applied to constant multiplications introduced from the decomposition. By exploiting the symmetry of twiddle factors, the algorithm also reduces the memory requirement for twiddle factors. These characteristics make the proposed algorithm suitable for long size FFT VLSI implementation. Based on the algorithm we propose an efficient pipeline FFT architecture and implement a 1024-point FFT processor by 0.18 um CMOS technology.

[1]  M. Omair Ahmad,et al.  Improved radix-4 and radix-8 FFT algorithms , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[2]  T. Arslan,et al.  Novel low power pipelined FFT based on subexpression sharing for wireless LAN applications , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

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

[4]  Shousheng He,et al.  Design and implementation of a 1024-point pipeline FFT processor , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

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

[6]  Hannu Tenhunen,et al.  A new VLSI-oriented FFT algorithm and implementation , 1998, Proceedings Eleventh Annual IEEE International ASIC Conference (Cat. No.98TH8372).

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

[8]  C. Joanblanq,et al.  A fast single-chip implementation of 8192 complex point FFT , 1995 .

[9]  Keshab K. Parhi,et al.  An efficient pipelined FFT architecture , 2003 .

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

[11]  Earl E. Swartzlander,et al.  An architecture for a radix-4 modular pipeline fast Fourier transform , 2003, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003.

[12]  Vinod Subramaniam,et al.  Digital video broadcasting (DVB); framing structure, channel coding and modulation for digital terr , 2001 .