A matrix version of the fast Fourier transform
F. Theilheimer · IEEE Transactions on Audio and Electroacoustics · 1969
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.