A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT
Authors:
- R. MersereauRMR. Mersereau
- T. SpeakeTST. Speake
- 1 October 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 29 (5) , 1011-1018
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A stepwise approach to computing the multidimensional fast Fourier transform of large arraysIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Fast computation of multidimensional discrete fourier transformsIEE Proceedings F Communications, Radar and Signal Processing, 1980
- The processing of hexagonally sampled two-dimensional signalsProceedings of the IEEE, 1979
- Fast computation of discrete Fourier transforms using polynomial transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Direct fast Fourier transform of bivariate functionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Two-dimensional digital filteringProceedings of the IEEE, 1975
- A Fast Computer Method for Matrix TransposingIEEE Transactions on Computers, 1972
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965