Paper Info
Title
Inverse polynomial transform algorithms for DFTs and convolutions
Abstract
In this paper, we introduce a new fast computation algorithm for multidimensional DFTs. This method uses inverse polynomial transforms to perform an efficient mapping of multidimensional DFTS into one-dimensional DFTs in a way similar to earlier polynomial transform techniques, but with all operations performed in reversed order. This is shown to yield fast DFT algorithms which retain the basic advantages related to the use of polynomial transforms while allowing a significant reduction in round-off noise. We then combine the direct and inverse polynomial transform methods to derive new fast algorithms for multidimensional convolutions.
Year
DOI
Venue
1981
10.1109/ICASSP.1981.1171273
Acoustics, Speech, and Signal Processing, IEEE International Conference ICASSP '81.
Keywords
Field
DocType
noise reduction,multidimensional systems,polynomials,computational complexity,arithmetic
Inverse,Mathematical optimization,Cyclotomic fast Fourier transform,Polynomial,Convolution,Computer science,Algorithm,Fast Fourier transform,Multidimensional systems,Computational complexity theory,Computation
Conference
Volume
Citations 
PageRank 
6
0
0.34
References 
Authors
2
1
Name
Order
Citations
PageRank
H. J. Nussbaumer13833.38