DocumentCode :
860516
Title :
Conjugate pair fast Fourier transform
Author :
Kamar, I. ; Elcherif, Y.
Author_Institution :
Dept. of Electron. & Commun. Eng., Cairo Univ., Giza, Egypt
Volume :
25
Issue :
5
fYear :
1989
fDate :
3/2/1989 12:00:00 AM
Firstpage :
324
Lastpage :
325
Abstract :
A new algorithm for the fast computation of the discrete Fourier transform is introduced. The algorithm, called the conjugate pair FFT (CPFFT), is used to compute a length-2n DFT. The number of multiplications and additions required by the CPFFT is less than that required by the SRFFT algorithm.
Keywords :
fast Fourier transforms; CPFFT; SRFFT; conjugate pair FFT; discrete Fourier transform; fast Fourier transform; length-2 n DFT;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19890225
Filename :
19743
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=860516
بازگشت