Efficient FFT algorithm for OFDM modulation

Yunho Jung Yunho Jung,Junhyun Park Junhyun Park,Jaeseok Kim Jaeseok Kim,Hyuncheol Park Hyuncheol Park,Dongkyu Kim Dongkyu Kim,Yonji Tak Yonji Tak

doi:10.1109/tencon.2001.949678

Yunho Jung Yunho Jung, Junhyun Park Junhyun Park + Show 4 more

https://doi.org/10.1109/tencon.2001.949678

Copy DOI

Publication Date: Aug 19, 2001

Citations: 5

Affiliation: Yonsei University, Samsung (South Korea)

Abstract

We propose an efficient FFT (fast Fourier transform) algorithm for OFDM (orthogonal frequency division multiplexing) modulation, named radix-4/2. This algorithm, based on the radix-4 butterfly operator reduces the number of non-trivial multiplications compared to the radix-2/sup 3/ FFT algorithm, and it has twice the processing rate as the radix-2/sup 3/ FFT algorithm. With 64-point and pipeline architecture, the proposed radix-4/2 algorithm reduces the number of non-trivial multiplications to the ratio of 3 to 2 compared with the radix-4 algorithm, and it has twice the processing rate as the radix-2/sup 3/ algorithm.

Full Text