On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution

DOI10.1109/TASSP.1981.1163520zbMath0523.65095OpenAlexW2097787813MaRDI QIDQ3674013

Chialin Wu, Richard G. Lipes, Trieu-Kien Truong, Irving S. Reed

Publication date: 1981

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tassp.1981.1163520

zbMATH Keywords

fast Fourier transformfast polynomial transformchinese remainder theoremtwo-dimensional convolutionnumber-theoretic transform

Mathematics Subject Classification ID

Related Items (2)

On algorithms for digital signal processing of sequences ⋮ An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms

This page was built for publication: On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution