On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution
- 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), 91-97
- https://doi.org/10.1109/tassp.1981.1163520
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fast computation of discrete Fourier transforms using polynomial transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- D.F.T. computation by fast polynomial transform algorithmsElectronics Letters, 1979
- Efficient transforms for multidimensional convolutionsElectronics Letters, 1979
- Computation of Convolutions and Discrete Fourier Transforms by Polynomial TransformsIBM Journal of Research and Development, 1978
- On the use of windows for harmonic analysis with the discrete Fourier transformProceedings of the IEEE, 1978
- Image Processing by Transforms Over a Finite FieldIEEE Transactions on Computers, 1977
- Digital filtering using polynomial transformsElectronics Letters, 1977
- Odd-time odd-frequency discrete Fourier transform for symmetric real-valued seriesProceedings of the IEEE, 1976
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965