DocumentCode
2245944
Title
An improved fast Fourier transform algorithm
Author
Guoan Bi Mieee ; Chen, Yan Qiu
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Volume
3
fYear
1997
fDate
9-12 Sep 1997
Firstpage
1308
Abstract
This letter presents a decomposition approach for discrete Fourier transforms of composite sequence lengths. Special techniques are used to achieve in-place computation. Compared to other algorithms, substantial reduction of arithmetic operations can be achieved
Keywords
computational complexity; discrete Fourier transforms; fast Fourier transforms; signal processing; arithmetic operations reduction; composite sequence lengths; decomposition approach; digital signal processing; discrete Fourier transform; fast Fourier transform algorithm; Arithmetic; Bismuth; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Signal processing algorithms; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on
Print_ISBN
0-7803-3676-3
Type
conf
DOI
10.1109/ICICS.1997.652199
Filename
652199
Link To Document