Prime power synthesis of linear transformations
S.D. Morgera · IEEE Transactions on Acoustics Speech and Signal Processing · 1980
A systematic technique is presented for synthesizing and efficiently performing large discrete Fourier transformations (DFT) in the range from 60-5000 points. Computational complexity is estimated and compared with the fast Fourier transform (FFT). Prime power pairs are found which minimize the computational complexity.