期刊文献+

Computational Performances of OFDM Using Different FFT Algorithms

Computational Performances of OFDM Using Different FFT Algorithms
下载PDF
导出
摘要 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. 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.
作者 Anwarul Azim
出处 《International Journal of Communications, Network and System Sciences》 2013年第7期346-350,共5页 通讯、网络与系统学国际期刊(英文)
关键词 Orthogonal Frequency Division MULTIPLEXING (OFDM) Discreate FOURIER TRANSFORM (DFT) FAST FOURIER TRANSFORM (FFT) Very FAST FOURIER TRANSFORM (VFFT) Orthogonal Frequency Division Multiplexing (OFDM) Discreate Fourier Transform (DFT) Fast Fourier Transform (FFT) Very Fast Fourier Transform (VFFT)

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部