Cooley-Tukey FFT Algorithms
In the following two chapters, we will concentrate on algorithms for computing the Fourier transform (FT) of a size that is a composite number N. The main idea is to use the additive structure of the indexing set Z/N to define mappings of input and output data vectors into two-dimensional arrays. Algorithms are then designed, transforming two-dimensional arrays which, when combined with these input/output mappings, compute the N-point FT. The stride permutations of chapter 2 play a major role.
KeywordsFast Fourier Transform Fast Fourier Transform Algorithm Vector Operation Twiddle Factor Product Notation
Unable to display preview. Download preview PDF.
- Gentleman, W. M., and Sande, G. “Fast Fourier Transform for Fun and Profit,” Proc. AFIPS, Joint Computer Conference 9 563–578, 1966.Google Scholar
- Pease, M. C. “An Adaptation of the Fast Fourier Transform for Parallel Processing,” J. ACM 18 843–846, 1971.Google Scholar
- Burrus, C. S. “Bit Reverse Unscrambling for a Radix 2m FFT,” IEEE Trans. Acoust., Speech and Signal Proc. 36 July, 1988.Google Scholar
- Burrus, C. S. and Park, T. W. DFT/FFT and Convolution Algorithms, John Wiley and Sons, 1985.Google Scholar
- Oppenheim, A. V. and Schafer, R. W. Digital Signal Processing, Prentice-Hall, 1975.Google Scholar
- Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, 1981.Google Scholar