IEEE Transactions on Computers · 1971 · 139 citations · 24 references
Natural SciencesMathematicsRepresentation TheoryDigital Signal ProcessingFourier AnalysisFrequency-domain AnalysisLinear TransformationsMatrix ComputationSignal ProcessingDirect ProductsDiscrete Fourier TransformFast Fourier TransformFourier TransformFourier Transform TheoryMatrix Representation Of TransformationsTransformations
The purpose of this note is to show as clearly as possible the mathematical relationship between the two basic fast methods used for the calculation of discrete Fourier transforms and to generalize one of the methods a little further. This method applies to all those linear transformations whose matrices are expressible as direct products.
24
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
An introduction to the theory of numbers
Journal of the Franklin Institute · 1960 · 3.7K citations
P. C. Mahalanobis · dialectica · 1954 · 1.7K citations
Hadamard transform image coding
William K. Pratt, Julius Kane, Harry C. Andrews · Proceedings of the IEEE · 1969 · 662 citations
An introduction to the theory of numbers
G. H. Hardy · Bulletin of the American Mathematical Society · 1929 · 607 citations · Full text