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

DOI10.1109/TASSP.1981.1163520zbMATH Open0523.65095OpenAlexW2097787813MaRDI QIDQ3674013FDOQ3674013

Authors: Richard G. Lipes, Chialin Wu, Trieu-Kien Truong, I. 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 transformchinese remainder theoremtwo-dimensional convolutionnumber-theoretic transformfast polynomial transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

Cited In (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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674013)