DocumentCode
3326467
Title
New Fast Fourier Transform with Linear Multiplicative Complexity
Author
Agaian, Sos S. ; Caglayan, Okan
Author_Institution
Lab. of Nonlinear Signal Process., Texas Univ., San Antonio, TX
fYear
2005
fDate
Oct. 28 2005-Nov. 1 2005
Firstpage
252
Lastpage
256
Abstract
In this paper, we introduced a new fast Fourier transform algorithm with linear multiplicative complexity for real and complex input signals. The proposed algorithm also reduces the total number of operations (arithmetic complexity, or the number of multiplications and additions) compared to the existing methods, such as Duhamel, Heideman, Burrus, Bi et al., Bouguezel et al
Keywords
computational complexity; fast Fourier transforms; signal processing; arithmetic complexity; complex input signals; fast Fourier transform; linear multiplicative complexity; Arithmetic; Communication systems; Computational complexity; Discrete Fourier transforms; Fast Fourier transforms; Fourier series; Image processing; Planets; Signal processing; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on
Conference_Location
Pacific Grove, CA
ISSN
1058-6393
Print_ISBN
1-4244-0131-3
Type
conf
DOI
10.1109/ACSSC.2005.1599743
Filename
1599743
Link To Document