Algorithm 545: An Optimized Mass Storage FFT [C6]
- 1 December 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 5 (4) , 500-517
- https://doi.org/10.1145/355853.355867
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Array Permutation by Index-Digit PermutationJournal of the ACM, 1976
- Two-dimensional transforms by minicomputers without matrix transposingComputer Graphics and Image Processing, 1975
- A Fast Computer Method for Matrix TransposingIEEE Transactions on Computers, 1972
- The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transformsJournal of Sound and Vibration, 1970
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967
- A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storageIEEE Transactions on Audio and Electroacoustics, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965