Academic Journals Database
Disseminating quality controlled scientific knowledge

Computational Performances of OFDM Using Different FFT Algorithms

ADD TO MY LIST
 
Author(s): Anwarul Azim

Journal: International Journal of Communications, Network and System Sciences
ISSN 1913-3715

Volume: 06;
Issue: 07;
Start page: 346;
Date: 2013;
Original page

Keywords: Orthogonal Frequency Division Multiplexing (OFDM) | Discreate Fourier Transform (DFT) | Fast Fourier Transform (FFT) | Very Fast Fourier Transform (VFFT)

ABSTRACT
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.
Save time & money - Smart Internet Solutions     

Tango Jona
Tangokurs Rapperswil-Jona