An improved FPT algorithm for computing two-dimensional cyclic convolutions

DOI10.1109/TASSP.1983.1164138zbMATH Open0564.65095OpenAlexW2138514684MaRDI QIDQ3678633FDOQ3678633

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

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

zbMATH Keywords

Chinese remainder theoremfast polynomial transformtwo-dimensional cyclic convolutions

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited In (6)

• Title not available (Why is that?)
• Improved fast polynomial transform algorithm for cyclic convolutions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms

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)