Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Good, I. J. “The Interaction Algorithm and Practical Fourier Analysis”, J. R. Statist Soc. B, 20(2), 1958, pp. 361–372.
Thomas, L. H. Using a Computer to Solve Problems in Physics, Application of Digital Computers, Ginn and Co., 1963.
Burrus, C. S. and Eschenbacher, P. W. “An In-place In-order Prime Factor FFT Algorithm”, IEEE Trans. Acoust. Speech and Signal Proc., 29(4), Aug. 1981, pp. 806–817.
Chu, S. and Burrus, C. S. “A Prime Factor FFT Algorithm Using Distributed Arithmetic”, IEEE Trans. Acoust. Speech and Signal Proc., 30(2), April 1982, pp. 217–227.
Kolba, D. P. and Parks, T. W. “A Prime Factor FFT Algorithm Using High-speed Convolution”, IEEE Trans. Acoust. Speech and Signal Proc., 25(4), Aug. 1977, pp. 281–294.
Blahut, R. E. Fast Algorithms for Digital Signal Processing, Addison-Wesley, 1985, Chapters 4 and 8.
Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, Second Edition, Springer-Verlag, 1982, Chapter 7.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tolimieri, R., Lu, C., An, M. (1997). MFTA: Product of Two Distinct Primes. In: Algorithms for Discrete Fourier Transform and Convolution. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2767-8_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2767-8_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3115-3
Online ISBN: 978-1-4757-2767-8
eBook Packages: Springer Book Archive