Selection criteria for efficient implementation of FFT algorithms
John David Blanken, Pedro L. Rustan · IEEE Transactions on Acoustics Speech and Signal Processing · 1982
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.