Abstract
A variant of the Cooley-Tukey algorithm due to Stockham is derived and vectorized and is shown to be on a par with the Pease algorithm. The Stockham algorithm is then proposed for the entire computation of the two-dimensional fast Fourier transform on a vector computer.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. W. Cooley and J. W. Tukey,An algorithm for the machine calculation of complex Fourier series, Math. Comp. 19 (1965), 297–301.
W. T. Cochran, et al.,What is the fast Fourier transform? IEEE Trans. Audio and Electroacoustics, VAU-15 (1967), 45–55.
D. G. Korn and J. J. Lambiotte,Computing the fast Fourier transform on a vector computer, Math. Comp. 33 (1979), 977–992.
M. C. Pease,An adaption of the fast Fourier transform for parallel processing, JACM, 15 (1968), 252–264.
R. C. Singleton,On computing the fast Fourier transform, CACM 10 (1967), 647–654.
H. S. Stone,Parallel processing with the perfect shuffle, IEEE Trans. Computers, VC 20 (1971), 153–161.
R. E. Twogood and M. P. Ekstrom,An extension of Eklundh's algorithm for transposing large matrices, IEEE Trans. Computers, VC-25 (1976), 950–952.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, H.H. On vectorizing the fast fourier transform. BIT 20, 233–243 (1980). https://doi.org/10.1007/BF01933196
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933196