Computational Performances of OFDM Using Different FFT Algorithms ()
Affiliation(s)
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.
KEYWORDS
Share and Cite:
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.