Computational Performances of OFDM Using Different FFT Algorithms

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.

Unjuk Kerja Sistem Ofdm Dengan Menggunakan Algoritma VFFT Pada Kanal Awgn

“…Sedangkan Discrete Fourier Transform (DFT) adalah metode matematis untuk mentransformasi sinyal pada domain waktu.diskrit ke dalam frekuensi domain. Secara matematis suatu barisan data x(n), panjang N, dalam DFT dapat didefinisikan sebagai berikut [7].…”