论文信息 - A matrix version of the fast Fourier transform

A matrix version of the fast Fourier transform

The fast Fourier transform is considered to owe its speed to the fact that a certain matrix, none of whose elements is zero, can be factored into matrices with very many zeros. This paper describes and discusses a procedure for explicitly carrying out such a factorization.

F. Theilheimer

[1] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[2] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

[3] W. M. Gentleman,et al. Fast Fourier Transforms: for fun and profit , 1966, AFIPS '66 (Fall).

[4] W. Morven Gentleman,et al. Matrix multiplication and fast fourier transforms , 1968 .

[5] Marshall C. Pease,et al. An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.