MFTA: Transform Size N = Mr M-Composite Integer and r-Prime
In this chapter, we extend the methods introduced in the proceeding two chapters to include the case of transform size N, N a product of three or more distinct primes. In fact, we will give a procedure for designing algorithms for transform size N = Mr, M and r relatively prime and r prime, whenever an algorithm for transform size M is given. We will also include FT algorithms for transform size N = 4M where M is a product of distinct odd primes.
KeywordsFast Fourier Transform Direct Computation Discrete Fourier Transform Digital Signal Processing Complete System
Unable to display preview. Download preview PDF.
- Blahut, R. E. Fast Algorithms for Digital Signal Processing, Chapter 6, 8. Addison-Wesley, 1985.Google Scholar
- Johnson, R.W. Lu, Chao and Tolimieri, R. “Fast Fourier Algorithms for the Size of 4p and 4pq and Implementations on VAX”, submitted for publication.Google Scholar
- Lu, Chao Fast Fourier Transform Algorithms for Special N’s and the Implementations on VAX, Ph.D. Dissertation. Jan., 1988, the City University of New York.Google Scholar
- Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, second edition, Chapter 7, Springer-Verlag,1982.Google Scholar