An efficient locally pipelined FFT processor

The fast Fourier transform (FFT) is a very important algorithm in digital signal processing. The locally pipelined (LPPL) architecture is an efficient structure for FFT processor designing in a real-time embedded system. Two basic building blocks, to the LPPL FFT processor, the butterfly in pipeline, and address generating, are discussed in this brief. Based on the "deep" feedback to butterfly-2, a novel approach for pipelined architecture, the radix-2 single-path deep delay feedback architecture is proposed. For length-N discrete Fourier transform computation, the dominant hardware requirements are minimal for complex multipliers log/sub 4/N-1 and adders 2log/sub 4/N. As an integral need of the LPPL FFT processor design, address generating and coefficient store-load structures are also presented.

[1]  Hannu Tenhunen,et al.  A pipelined shared-memory architecture for FFT processors , 1999, 42nd Midwest Symposium on Circuits and Systems (Cat. No.99CH36356).

[2]  D. Cohen Simplified control of FFT hardware , 1976 .

[3]  Han Yue-qiu A Fast Address Generation Scheme for FFT Processor , 2006 .

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

[5]  Yutai Ma,et al.  An effective memory addressing scheme for FFT processors , 1999, IEEE Trans. Signal Process..

[6]  T. M. Hopkinson,et al.  A pipelined, high-precision FFT architecture , 1992, [1992] Proceedings of the 35th Midwest Symposium on Circuits and Systems.

[7]  Lars Wanhammar,et al.  A hardware efficient control of memory addressing for high-performance FFT processors , 2000, IEEE Trans. Signal Process..

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

[9]  Weidong Li,et al.  A pipeline FFT processor , 1999, 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461).

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

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

[12]  Chin-Liang Wang,et al.  A new memory-based FFT processor for VDSL transceivers , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[13]  Nam Ik Cho,et al.  Design of 2K/4K/8K-point FFT processor based on CORDIC algorithm in OFDM receiver , 2001, 2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233).

[14]  John V. McCanny,et al.  A 64-point Fourier transform chip for video motion compensation using phase correlation , 1996, IEEE J. Solid State Circuits.

[15]  L. Wanhammar,et al.  A coefficient access control for low power FFT processors , 1999, 42nd Midwest Symposium on Circuits and Systems (Cat. No.99CH36356).

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

[17]  Chin-Liang Wang,et al.  A novel memory-based FFT processor for DMT/OFDM applications , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

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

[19]  Earl E. Swartzlander,et al.  A pipelined architecture for the multidimensional DFT , 2001, IEEE Trans. Signal Process..