Abstract
This paper presents a multi-algorithm approach to computing one-dimensional FFTs. The type of parallelism introduced is most amenable to execution on multi-headed vector machines. The usage of multiple algorithms provides high performance regardless of transform size.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal, R. 1987. An efficient formulation of the mixed-radix FFT algorithm. IBM T.J. Watson Research Center, Yorktown Heights, N.Y.
Bailey, D. 1987. A high-performance fast Fourier transform algorithm for the CRAY-2. The Journal of Supercomputing, 1, 1: 43–60.
Bailey, D. 1988. A high-performance FFT algorithm for vector supercomputers. To appear in Journal of Supercomputing Applications.
Brigham, E. 1974. The Fast Fourier Transform. Prentice-Hall, Englewood Cliffs, N.J.
Dougherty, G., Dougherty, R., and Stanley, W. 1984. Digital Signal Processing, 2nd ed. Reston Pub. Co., Reston, Va., pg. 272.
Fornberg, B. 1981. A vector implementation of the fast Fourier transform algorithm. Math. Comp., 36: 189–191.
Glassman, J. 1970. A generalization of the fast Fourier transform. IEEE Trans. Computers, C-19, 2: 106–166.
Rabiner, L.R., and Gold, B. 1975. Theory and Application of Digital Signal Processing. Prentice-Hall, Englewood Cliffs, N.J.
Pease, M.C. 1968. An adaptation of the fast Fourier transform for parallel processing. Journal of the ACM, 15: 252–264.
Swartztrauber, P.N. 1984. FFT algorithms for vector computers. Parallel Computing, 1: 45–63.
Swartztrauber, P.N. 1987. Multiprocessor FFTs. Parallel Computing, 5: 197–210.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Armstrong, J. A multi-algorithm approach to very high performance one-dimensional FFTs. J Supercomput 2, 415–433 (1988). https://doi.org/10.1007/BF00156677
Issue Date:
DOI: https://doi.org/10.1007/BF00156677