Open AccessOn accelerating the FFT of Cooley and Tukey
Author(s) -
SK MISHRA
Publication year - 1985
Publication title -
mausam
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.243
H-Index - 12
ISSN - 0252-9416
DOI - 10.54302/mausam.v36i2.1833
Subject(s) - fast fourier transform , split radix fft algorithm , prime factor fft algorithm , rader's fft algorithm , computation , computer science , twiddle factor , algorithm , cooley–tukey fft algorithm , set (abstract data type) , arithmetic , fourier transform , parallel computing , mathematics , fourier analysis , short time fourier transform , mathematical analysis , programming language
The efficient Fourier transform (EFT) and FFT algorithms are described and their computational efficiencies with respect to the direct method are discussed. An efficient procedure is proposed for the reordering of data set; the use of EFT algorithm for the initial Fourier transforms and restricting the size of final subsets to not less than 4 is also suggested for saving computation time in the FFT. It is found that on average the FFT with the proposed modifications is more than twice as fast as the original FFT. The amount of overhead operations involved in computer routine, based on the modified FFT is estimated.