The Relationship Between Two Fast Fourier Transforms
- 1 March 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (3) , 310-317
- https://doi.org/10.1109/t-c.1971.223236
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- A Generalized Technique for Spectral AnalysisIEEE Transactions on Computers, 1970
- Polynomial Algebra: an Application of the Fast Fourier TransformNature, 1969
- Hadamard transform image codingProceedings of the IEEE, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Analogues of Poisson's Summation FormulaThe American Mathematical Monthly, 1962
- The serial test for sampling numbers and other tests for randomnessMathematical Proceedings of the Cambridge Philosophical Society, 1953
- The Design and Analysis of Experiment. By M. H. Quenouille.Annals of Eugenics, 1952
- Random motion on a finite Abelian groupMathematical Proceedings of the Cambridge Philosophical Society, 1951
- On the Inversion of Circulant MatricesBiometrika, 1950
- Some improvements in practical Fourier analysis and their application to x-ray scattering from liquidsJournal of the Franklin Institute, 1942