By Topic

New polynomial transform algorithms for multidimensional DFT's and 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
$33 $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

1 Author(s)
H. Nussbaumer ; Centre d'Etudes et Recherches, IBM France, France

This paper introduces a new method for the computation of multidimensional DFT's by polynomial transforms. The method, which maps mtiltidimensional DFT's into one-dimensional odd-time DFT's by use of inverse polynomial transforms, is shown to be significantly more efficient than the conventional row-column method from the standpoint of the number of arithmetic operations and quantization noise. The relationship between DFT and convolution algorithms using polynomial transforms is clarified and new convolution algorithms with reduced computational complexities are proposed.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:29 ,  Issue: 1 )