Cooley-Tukey FFT Algorithms
In the following two chapters, we will concentrate on algorithms for computing FFT of size a composite number N. The main idea is to use the additive structure of the indexing set Z/N to define mappings of the input and output data vectors into 2-dimensional arrays. Algorithms are then designed, transforming 2-dimensional arrays which, when combined with these mappings, compute the N-point FFT. The stride permutations of chapter 2 play a major role.
KeywordsFast Fourier Transform Vector Operation Fast Fourier Trans Twiddle Factor Commutation Theorem
Unable to display preview. Download preview PDF.
- Gentleman, W. M., Sande, G. ”Fast Fourier Transform for Fun and Profit,” Proc.AFIPS, Joint Computer Conference, vol.29,1966, pp.563–578.Google Scholar
- Pease, M. C. ”An Adaptation of the Fast Fourier Transform for Parallel Processing,” J. ACM, vol 8, 1971, pp.843–846.Google Scholar
- Burrus, C.S. ”Bit Reverse Unscrambling for a Radix 2m FFT”, IEEE Trans. on ASSP, vol. 36, July, 1988.Google Scholar
- Burrus, C.S. and Park, T.W. DFT/FFT and Convolution Algorithms New York: John Wiley and Sons, 1985.Google Scholar