摘要:
acm.org
sci-hub.se 参考文章(7)
R. Singleton, A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage IEEE Transactions on Audio and Electroacoustics. ,vol. 15, pp. 91- 98 ,(1967) , 10.1109/TAU.1967.1161906
J.W. Cooley, P.A.W. Lewis, P.D. Welch, The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms☆ Journal of Sound and Vibration. ,vol. 12, pp. 315- 337 ,(1970) , 10.1016/0022-460X(70)90075-1
I. DeLotto, D. Dotti, Two-dimensional transforms by minicomputers without matrix transposing Computer Graphics and Image Processing. ,vol. 4, pp. 271- 278 ,(1975) , 10.1016/0146-664X(75)90013-1
J.O. Eklundh, A Fast Computer Method for Matrix Transposing IEEE Transactions on Computers. ,vol. C-21, pp. 801- 803 ,(1972) , 10.1109/T-C.1972.223584
James W. Cooley, John W. Tukey, An algorithm for the machine calculation of complex Fourier series Mathematics of Computation. ,vol. 19, pp. 297- 301 ,(1965) , 10.1090/S0025-5718-1965-0178586-1
Donald Fraser, Array Permutation by Index-Digit Permutation Journal of the ACM. ,vol. 23, pp. 298- 309 ,(1976) , 10.1145/321941.321949
W. Cochran, J. Cooley, D. Favin, H. Helms, R. Kaenel, W. Lang, G. Maling, D. Nelson, C. Rader, P. Welch, What is the fast Fourier transform IEEE Transactions on Audio and Electroacoustics. ,vol. 15, pp. 45- 55 ,(1967) , 10.1109/TAU.1967.1161899