MFTA: Composite Size
In this chapter, we extend the methods introduced in the preceding two chapters to include the case of a transform size that is a product of three or more distinct primes. In fact, we will give a procedure for designing algorithms for transform size N = Mr, r a prime not dividing M, whenever an algorithm for transform size M is given. We will also include FT algorithms for transform size 4M, where M is a product of distinct odd primes.
KeywordsFast Fourier Transform Discrete Fourier Transform Complete System Fundamental Factorization Real Multiplication
Unable to display preview. Download preview PDF.
- Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapters 6 and 8.Google Scholar
- Lu, C. Fast Fourier Transform Algorithms for Special N’s and the Implementations on VAX, Ph.D. Dissertation, The City University of New York, Jan. 1988.Google Scholar
- Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1982, Chapter 7.Google Scholar