DocumentCode
1991151
Title
A high-speed low-complexity modified radix-25 FFT processor for gigabit WPAN applications
Author
Cho, Taesang ; Lee, Hanho ; Park, Jounsup ; Park, Chulgyun
Author_Institution
Sch. of Inf. & Commun. Eng., Inha Univ., Incheon, South Korea
fYear
2011
fDate
15-18 May 2011
Firstpage
1259
Lastpage
1262
Abstract
In this paper, we present a novel modified radix-25 algorithm for 512-point fast Fourier transform (FFT) computation and high-speed eight-parallel data-path architecture for multi-gigabit wireless personal area network (WPAN) systems. The proposed FFT processor can provide a high data throughput and low hardware complexity by using eight-parallel data-path and multi-path delay-feedback (MDF) structure. The modified radix-25 FFT algorithm is also realized in our processor to reduce the number of complex multiplications and twiddle factor look-up tables. The proposed FFT processor has been designed and implemented with 90nm CMOS technology in a supply voltage of 1.2V. The proposed 512-point modified radix-25 FFT/IFFT processor has a throughput rate of up to 2.8 GS/s at 350 MHz while requiring much smaller hardware complexity and low power consumption.
Keywords
delays; fast Fourier transforms; parallel architectures; personal area networks; table lookup; CMOS technology; IFFT processor; fast Fourier transform; frequency 350 MHz; gigabit WPAN; look up tables; multi-path delay feedback; parallel data path architecture; radix-25 FFT processor; size 90 nm; twiddle factor; voltage 1.2 V; wireless personal area network; Complexity theory; Hardware; OFDM; Table lookup; Throughput; Wireless personal area networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems (ISCAS), 2011 IEEE International Symposium on
Conference_Location
Rio de Janeiro
ISSN
0271-4302
Print_ISBN
978-1-4244-9473-6
Electronic_ISBN
0271-4302
Type
conf
DOI
10.1109/ISCAS.2011.5937799
Filename
5937799
Link To Document