Fast polynomial transform algorithms for digital convolution
- 1 April 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 28 (2), 205-215
- https://doi.org/10.1109/tassp.1980.1163372
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- New algorithms for digital convolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial TransformsIBM Journal of Research and Development, 1978
- New algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Digital filtering using polynomial transformsElectronics Letters, 1977
- Digital Filtering Using Complex Mersenne TransformsIBM Journal of Research and Development, 1976
- A new principle for fast Fourier transformationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Number theoretic transforms to implement fast digital convolutionProceedings of the IEEE, 1975
- Fast one-dimensional digital convolution by multidimensional techniquesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Discrete Convolutions via Mersenne TransformsIEEE Transactions on Computers, 1972
- Fast Convolution Using the Walsh TransformIEEE Transactions on Electromagnetic Compatibility, 1971