Fast polynominal transforms for two-dimensional convolution

DOI10.1109/TASSP.1982.1163969zbMATH Open0564.65094MaRDI QIDQ3678632FDOQ3678632

Authors: Jean-Bernard Martens 

Publication date: 1982

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

Recommendations

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

zbMATH Keywords

two-dimensional convolutionsfast polynomial transforms

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited In (7)

• An efficient method for performing discrete convolution using Kronecker products
• Application of the fast Fourier transform to calculating pruned convolution
• Title not available (Why is that?)
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions
• Study on the overlapping addition method to compute two-dimensional convolution
• An efficient algorithm for cyclic convolution based on fast-polynomial and fast-\(W\) transforms
• Polynomial transform based algorithms for computing two-dimensional generalized DFT, generalized DHT, and skew circular convolution.

This page was built for publication: Fast polynominal transforms for two-dimensional convolution

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