Variants of FFT Algorithm and Their Implementations
In chapter 3, additive FFT algorithms were derived corresponding to the factorization of the transform size N into the product of two factors. Analogous algorithms will now be designed corresponding to transform sizes given as the product of three or more factors. In general, as the number of factors increases, the number of possible algorithms increases.
KeywordsFast Fourier Transform Permutation Matrice Vector Computer Fast Fourier Trans Vector Factor
Unable to display preview. Download preview PDF.
- Agarwal R. C. and Cooley, J. W. ”Vectorized Mixed Radix Discrete Fourier Transform Algorithms”. March 1986, IBM Report.Google Scholar
- Gentleman, W.M. and Sande, G. ”Fast Fourier Transform for Fun and Profit,” Proc. AFIPS, Joint Computer Conference, vol 29, 1966, pp.563–578.Google Scholar
- Temperton, C. ”Self-Sorting Mixed Radix Fast Fourier Transforms,” Journal of Computational Physics, vol.52, 1983, ppl–23.Google Scholar
- Temperton, C. ”Implementation of a Prime Factor FFT algorithm on the CRAY-1,” 1987, to appear in J. Comput. Phys.Google Scholar
- Heideman, M.T. and Burrus, C.S. ”Multiply/add Tradeoff in Length-2n FFT Algorithms”, ICASSP’85, pp. 780-783.Google Scholar
- Duhamel, P. ”Implementation of ”Split-Radix” FFT Algorithms for Complex, Real, and Real-Symmetric Data”, IEEE Trans, on ASSP, vol.34, No. 2, April 1986.Google Scholar
- Vetterli, M. and Duhamel, P. ” Split-Radix Algorithms for Length pm DFT’s“, ICASSP’88, pp. 1415-1418.Google Scholar