Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blahut, R. E. Fast Algorithms for Digital Signal Processing, Chapter 6, 8. Addison-Wesley, 1985.
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.
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.
Nussbaumer, H. J. Fast Fourier Transform and Convolution Algorithms, second edition, Chapter 7, Springer-Verlag,1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tolimieri, R., An, M., Lu, C. (1989). MFTA: Transform Size N = Mr M-Composite Integer and r-Prime. In: Burrus, C.S. (eds) Algorithms for Discrete Fourier Transform and Convolution. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3854-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3854-4_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3856-8
Online ISBN: 978-1-4757-3854-4
eBook Packages: Springer Book Archive