Variants of FT Algorithms and Implementations
In chapter 3, additive FT algorithms were derived corresponding to the factorization of the transform size N into a product of two factors. Analogous algorithms will now be designed corresponding to transform sizes given as a product of three or more factors. In general, as the number of factors increases, the number of possible algorithms increases.
KeywordsFast Fourier Transform Stage Computation Twiddle Factor Commutation Theorem Vector Instruction
Unable to display preview. Download preview PDF.
- Agarwal, R. C. and Cooley, J. W. “Vectorized Mixed Radix Discrete Fourier Transform Algorithms”, IBM Report., March 1986.Google Scholar
- Gentleman, W. M. and Sande, G. “Fast Fourier Transform for Fun and Profit”, Proc. AFIPS, Joint Computer Conference 29, 1966, 563–578.Google Scholar
- Temperton, C. “Fast Fourier Transforms and Poisson-Solvers on Cray-1”, Supercomputers, Infotech State of the Art Report, Jesshope C. R. and Hockney R. W. eds., Infotech International Ltd., 1979, 359-379.Google Scholar
- Heideman, M. T. and Burrus, C. S. “Multiply/add Trade-off in Length-2n FFT Algorithms”, ICASSP’85, 780-783.Google Scholar
- Duhamel, P. “Implementation of Split-Radix FFT Algorithms for Complex, Real, and Real-Symmetric Data”, IEEE Trans. on Acoust., Speech and Signal Proc. 34 (2), April 1986.Google Scholar
- Vetterli, M. and Duhamel, P. “Split-Radix Algorithms for Length p m DFT’s”, ICASSP’88, 1415-1418.Google Scholar