New polynomial transform algorithms for multidimensional DFT's and convolutions
- 1 February 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 29 (1) , 74-84
- https://doi.org/10.1109/tassp.1981.1163510
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fast polynomial transform algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- D.F.T. computation by fast polynomial transform algorithmsElectronics Letters, 1979
- Fast computation of discrete Fourier transforms using polynomial transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- Efficient transforms for multidimensional convolutionsElectronics Letters, 1979
- Fixed-point error analysis of winograd Fourier transform algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial TransformsIBM Journal of Research and Development, 1978
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A new principle for fast Fourier transformationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Odd-time odd-frequency discrete Fourier transform for symmetric real-valued seriesProceedings of the IEEE, 1976
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965