Title :
A High-Speed Low-Complexity Modified
FFT Processor for High Rate WPAN Applications
Author :
Cho, Taesang ; Lee, Hanho
Author_Institution :
Dept. of Inf. & Commun. Eng., Inha Univ., Incheon, South Korea
Abstract :
This paper presents a high-speed low-complexity modified radix-25 512-point fast Fourier transform (FFT) processor using an eight data-path pipelined approach for high rate wireless personal area network applications. A novel modified radix-25 FFT algorithm that reduces the hardware complexity is proposed. This method can reduce the number of complex multiplications and the size of the twiddle factor memory. It also uses a complex constant multiplier instead of a complex Booth multiplier. The proposed FFT processor achieves a signal-to-quantization noise ratio of 35 dB at 12 bit internal word length. The proposed processor has been designed and implemented using 90-nm CMOS technology with a supply voltage of 1.2 V. The results demonstrate that the total gate count of the proposed FFT processor is 290 K. Furthermore, the highest throughput rate is up to 2.5 GS/s at 310 MHz while requiring much less hardware complexity.
Keywords :
CMOS integrated circuits; fast Fourier transforms; personal area networks; quantisation (signal); CMOS technology; FFT processor; WPAN applications; fast Fourier transform; high-speed low-complexity modified radix-25; signal-to-quantization noise ratio; size 90 nm; twiddle factor memory; voltage 1.2 V; word length 12 bit; Complexity theory; Computer architecture; Hardware; OFDM; Throughput; Very large scale integration; Wireless personal area networks; Fast Fourier transform (FFT); modified ${rm radix}-2^{5}$; orthogonal frequency-division multiplexing (OFDM); wireless personal area network (WPAN);
Journal_Title :
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
DOI :
10.1109/TVLSI.2011.2182068