Scalable FFT architecture vs. multiple pipeline FFT architectures — Hardware implementation and cost

This paper presents a family of architectures for FFT implementation based on the decomposition of the perfect shuffle permutation, which can be designed with variable number of processing elements. This provides designers with a trade-off choice of speed vs. complexity (cost and area.). Hardware comparison to other existing pipeline architecture presented based on implementation of 1024-point FFT with 4 processing elements using 45nm process technology. The proposed architecture is most suitable for handheld and portable multimedia applications

[1]  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).

[2]  Francisco Argüello,et al.  Application-specific architecture for fast transforms based on the successive doubling method , 1993, IEEE Trans. Signal Process..

[3]  Xin Fan.  A VLSI-oriented FFT algorithm and its pipelined design , 2008, 2008 9th International Conference on Signal Processing.

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

[5]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[6]  David Akopian,et al.  A family of scalable FFT architectures and an implementation of 1024-point radix-2 FFT for real-time communications , 2008, 2008 IEEE International Conference on Computer Design.

[7]  Chien-Ming Wu,et al.  Design of an efficient FFT processor for DAB system , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[8]  Ke Liu,et al.  A hardware efficient VLSI architecture for FFT processor in OFDM systems , 2005, 2005 6th International Conference on ASIC.

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

[10]  Peter Liu,et al.  Minimizing the memory requirement for continuous flow FFT implementation: continuous flow mixed mode FFT (CFMM-FFT) , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

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

[12]  Francisco Argüello,et al.  A VLSI Constant Geometry Architecture for the Fast Hartley and Fourier Transforms , 1992, IEEE Trans. Parallel Distributed Syst..

[13]  Jaakko Astola,et al.  Multistage interconnection networks for parallel Viterbi decoders , 2003, IEEE Trans. Commun..

[14]  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.

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