MFTA: Product of Two Distinct Primes
The results of chapter 9 will now be extended to the case of a transform size that is a product of two distinct primes. As mentioned in the general introduction to multiplicative FT algorithms, several approaches exist for combining small size algorithms into medium or large size FT algorithms by the Good-Thomas FFT. The advantage of using the Good-Thomas FFT is that tensor product rules directly construct multiplicative FT algorithms for appropriate composite size cases. The method is completely algebraic and results in composite size algorithms whose factors contain tensor products of prime size factors. However, these results are not totally appealing since complex permutations appear. A related problem is that tensor products are taken over direct sum factors.
KeywordsTensor Product Discrete Fourier Transform Fundamental Factorization Basic Algebra Real Multiplication
Unable to display preview. Download preview PDF.
- Thomas, L. H. Using a Computer to Solve Problems in Physics, Application of Digital Computers, Ginn and Co., 1963.Google Scholar
- Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapters 4 and 8.Google Scholar
- Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1982, Chapter 7.Google Scholar