DocumentCode
1140850
Title
Comments on "An FFT algorithm based fast algorithm for arbitrary polynomial transformation
Author
Wang, Shuenn-Shyang ; Lin, Wen-Guo
Author_Institution
Dept. of Electr. Eng., Tatung Inst. of Technol., Taipei, Taiwan
Volume
39
Issue
9
fYear
1991
Firstpage
2140
Lastpage
2141
Abstract
Comments are made on the work by H. Krishna (see ibid., vol.37, no.10, p.1612-14, 1989). Krishna presented an elegant fast algorithm for the arbitrary polynomial transformation based on the fast Fourier transform algorithm. It is pointed out that if he applies the discrete Fourier transform (DFT) and inverse (DFT) pair defined in one of his references (H.J. Nussbaumer, 1981), then the final results are not precisely correct.<>
Keywords
fast Fourier transforms; polynomials; FFT algorithm based fast algorithm; arbitrary polynomial transformation; discrete Fourier transform; inverse DFT pair; Biomedical measurements; Biomedical signal processing; Diffraction; Discrete Fourier transforms; Image resolution; Polynomials; Signal processing algorithms; Signal resolution; Speech processing; Tomography;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.134457
Filename
134457
Link To Document