By Topic

Discrete transforms over polynomial rings with applications in computing multidimensional convolutions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Arambepola, B. ; University of Cambridge, Cambridge, England ; Rayner, P.J.W.

Discrete transforms over polynomial rings are developed and rings that possess simple transform kernels are investigated. A polynomial transform is used to transform a linear multidimensional convolution into a set of one-dimensional noncircular convolutions. A mapping which can be used to convert a noncircular convolution into a circular one and vice versa is presented. This is used to map the one-dimensional noncircular convolutions resulting from the polynomial transforms into circular ones, for which efficient discrete transform methods do exist. A convolution circular in all dimensions is computed by mapping one of its dimensions into a noncircular form and using the same polynomial transforms. Several other methods of evaluating multidimensional circular convolutions using polynomial transforms are also described. It is shown that these polynomial transforms can be evaluated using FFT-type computational algorithms. This class of polynomial transforms is free of multiplications and hence represents a suitable technique for the fast, accurate computation of multidimensional convolutions.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:28 ,  Issue: 4 )