Title :
Selection criteria for efficient implementation of FFT algorithms
Author :
Blanken, J.D. ; Rustan, P.L.
Author_Institution :
Air Force Institute of Technology, Wright-Patterson AFB, OH
fDate :
2/1/1982 12:00:00 AM
Abstract :
The number of real operations and memory is presented for three efficient Fortran algorithms which compute the mixed radix discrete Fourier transform (DFT). It is shown that Singleton´s mixed radix algorithm (MFFT) is the most flexible and uses the least memory, while the Winograd Fourier transform algorithm (WFTA) and Kolba-Parks prime factor algorithm (PFA) are the most efficient.
Keywords :
Array signal processing; Digital signal processing; Discrete Fourier transforms; IEEE Press; Military computing; Packaging; Signal processing algorithms; Speech processing; Testing; Velocity measurement;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
DOI :
10.1109/TASSP.1982.1163858
