DocumentCode
1234445
Title
An FFT algorithm based fast algorithm for arbitrary polynomial transformation
Author
Krishna, Harl
Author_Institution
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
Volume
37
Issue
10
fYear
1989
fDate
10/1/1989 12:00:00 AM
Firstpage
1612
Lastpage
1614
Abstract
A fast algorithm for the arbitrary polynomial transformation is described. This algorithm is based on the fast Fourier transform (FFT) algorithm and reduces the computational complexity of a recently proposed recursive algorithm by an order of magnitude
Keywords
fast Fourier transforms; polynomials; FFT algorithm; arbitrary polynomial transformation; computational complexity; Computational complexity; Digital filters; Frequency estimation; Least squares methods; Notice of Violation; Polynomials; Signal processing; Signal processing algorithms; Speech analysis; Speech processing;
fLanguage
English
Journal_Title
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
0096-3518
Type
jour
DOI
10.1109/29.35405
Filename
35405
Link To Document