An improved FPT algorithm for computing two-dimensional cyclic convolutions

DOI10.1109/TASSP.1983.1164138MaRDI QIDQ3678633zbMATH OpenOpenAlexFDO

Authors Chiunn- Shyong Yeh, Howard M. Shao, I. S. Reed, Trieu-Kien Truong

Publication date 1983

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.1983.1164138

zbMATH Keywords

Chinese remainder theoremfast polynomial transformtwo-dimensional cyclic convolutions

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• scientific article; zbMATH DE number 3980375
• Improved fast polynomial transform algorithm for cyclic convolutions
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions
• scientific article; zbMATH DE number 123830
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings

Cited in

(6)

• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms
• scientific article; zbMATH DE number 123830 (Why is no real title available?)
• scientific article; zbMATH DE number 1474985 (Why is no real title available?)
• scientific article; zbMATH DE number 1475150 (Why is no real title available?)
• Improved fast polynomial transform algorithm for cyclic convolutions
• scientific article; zbMATH DE number 3980375 (Why is no real title available?)

This page was built for publication: An improved FPT algorithm for computing two-dimensional cyclic convolutions

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