Discrete transforms over polynomial rings with applications in computing multidimensional convolutions

DOI10.1109/TASSP.1980.1163425zbMATH Open0523.65094MaRDI QIDQ3674010FDOQ3674010

Authors: Bernard Arambepola, P. J. Rayner 

Publication date: 1980

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

zbMATH Keywords

signal processingfast Fourier transformmultidimensional convolutiondiscrete transforms over polynomial ringsnoncircular convolution

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40)

Cited In (1)

• Fast algorithms for computing one- and two-dimensional convolution in integer polynomial rings

This page was built for publication: Discrete transforms over polynomial rings with applications in computing multidimensional convolutions

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