Abstract
In chapter 3, additive FT algorithms were derived corresponding to the factorization of the transform size N into a product of two factors. Analogous algorithms will now be designed corresponding to transform sizes given as a product of three or more factors. In general, as the number of factors increases, the number of possible algorithms increases.
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
Agarwal, R. C. and Cooley, J. W. “Vectorized Mixed Radix Discrete Fourier Transform Algorithms”, IBM Report., March 1986.
Cochran, W. T., et al. “What is the Fast Fourier Transform?”, IEEE Trans. Audio Electroacoust. 15, 1967, 45–55.
Cooley, J. W. and Tukey, J. W. “An Algorithm for the Machine Calculation of Complex Fourier Series”, Math. Comp. 19, 1965, 297–301.
Gentleman, W. M. and Sande, G. “Fast Fourier Transform for Fun and Profit”, Proc. AFIPS, Joint Computer Conference 29, 1966, 563–578.
Korn, D. G. and Lambiotte, J. J. “Computing the Fast Fourier Transform on a Vector Computer”, Math. Comp. 33, 1979, 977–992.
Pease, M. C. “An Adaptation of the Fast Fourier Transform for Parallel Processing”, J. ACM 15, 1968, 252–265.
Singleton, R. C. “On Computing the Fast Fourier Transform”, J. A CM 10, 1967, 647–654.
Singleton, R. C. “An Algorithm for Computing the Mixed Radix Fast Fourier Transform”, IEEE Trans. Audio Electroacoust. 17, 1969, 93–103.
Temperton, C. “Self-Sorting Mixed Radix Fast Fourier Transforms”, J. Comput Phys. 52, 1983, 1–23.
Temperton, C. “Fast Fourier Transforms and Poisson-Solvers on Cray-1”, Supercomputers, Infotech State of the Art Report, Jesshope C. R. and Hockney R. W. eds., Infotech International Ltd., 1979, 359-379.
Temperton, C. “Implementation of a Self-Sorting In-Place Prime Factor FFT algorithm”, J. Comput. Phys. 58(3), 1985, 283–299.
Temperton, C. “A Note on a Prime Factor FFT”, J. Comput Phys. 52(1), 1983, 198–204.
Heideman, M. T. and Burrus, C. S. “Multiply/add Trade-off in Length-2n FFT Algorithms”, ICASSP’85, 780-783.
Duhamel, P. “Implementation of Split-Radix FFT Algorithms for Complex, Real, and Real-Symmetric Data”, IEEE Trans. on Acoust., Speech and Signal Proc. 34 (2), April 1986.
Vetterli, M. and Duhamel, P. “Split-Radix Algorithms for Length p m DFT’s”, ICASSP’88, 1415-1418.
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). Variants of FT Algorithms and Implementations. 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2767-8_4
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