Computational Performances of OFDM Using Different FFT Algorithms

• 作者: Anwarul Azim
• 来源期刊: 通讯、网络与系统学国际期刊(英文)
• 学科: 工学
• 关键词: Orthogonal Frequency Division MULTIPLEXING (OFDM) Discreate FOURIER TRANSFORM (DFT) FAST FOURIER TRANSFORM (FFT) Very FAST FOURIER TRANSFORM (VFFT)
• 年，卷（期）: 2013,（7）
• 页码范围: 346-350
• 页数: 5页
• 分类号: TN91

摘要

In this paper, an intuitive comparison of the computational performance of orthogonal frequency division multiplexing (OFDM) system has been made in terms of complex calculations required using different Fourier transform techniques. The different transform techniques are introduced such as discrete Fourier transform (DFT) and various types of fast Fourier transform (FFT) as 2-radix FFT, 4-radix FFT etc. and the very recent very fast Fourier transform (VFFT). With intuitive mathematical analysis, it has been shown that with the reduced complexity that VFFT can offer, OFDM performance can be greatly improved in terms of calculations needed.