A new buffer-memory architecture for FFT computation

Memory-based designs of the fast Fourier transform (FFT) processor are attractive for single-chip implementation. Basically, their architectures can be divided into three types: single-memory design, dual-memory design, and buffer-memory design. Among them, the buffer-memory design can balance the trade-off between memory size and control circuit complexity. In this paper, we present a new buffer-memory architecture for realizing the radix-2 decimation-in-time N-point FFT algorithm. As compared with previous related works, the proposed design reaches the same throughput performance of two transform samples per log2N+1 clock cycles and 100% utilization efficiency in butterfly unit with fewer ROM access times of N-2. It is rather attractive for long-length FFT applications, such as very-high-rate digital subscriber lines and digital video broadcasting.

[1]  A. Delaruelle,et al.  A channel demodulator IC for digital audio broadcasting , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

[2]  Chin-Liang Wang,et al.  Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse , 2000, IEEE Trans. Signal Process..

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

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

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

[6]  Sau-Gee Chen,et al.  An efficient memory-based FFT architecture , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

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