1 Ministry of Electricity, State Company for Electric Power Production, Euphrates Middle Region, Iraq.
2 Department of Electric, College of Engineering, University of Babylon, Iraq.
International Journal of Science and Research Archive, 2025, 16(03), 1146-1152
Article DOI: 10.30574/ijsra.2025.16.3.2663
Received on 16 August 2025; revised on 23 September 2025; accepted on 25 September 2025
Here in this paper a review of some Fast Fourier Transform (FFT) algorithms are presented. FFT employs the idea of dividing the Discreet Fourier Transform (DFT) to smaller ones and compute each transform separately, in addition to transform the signals in time domain to frequency domain. There are several types of FFT, some of them deals with even samples (Radix II), while the other deals with any even samples. Off course there are types that deal with odd samples, but they are somehow complicated. Than we introduce other algorithm Sparse Fast Fourier Transform (SFT) which outperform the old FFT and have better performance when we have very large input sequence. Than the multidimensional FFT is reviewed. In addition to summarized some FFT's applications.
FFT Algorithms; DSP; 2DFFT; SFT Algorithms; Applications of FFT and SFT
Preview Article PDF
Ahmed Faris Hameed and Osama Qasim Jumah Al-Thahab. Comprehensive review on fast Fourier transform types and their applications. International Journal of Science and Research Archive, 2025, 16(03), 1146-1152. Article DOI: https://doi.org/10.30574/ijsra.2025.16.3.2663.
Copyright © 2025 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0
