DocumentCode :
1310238
Title :
Comment on Conjugate pair fast Fourier transform
Author :
Quian, H.-S. ; Zhao, H.-J.
Author_Institution :
Dept. of Electron. Eng., Hangzhou Inst. of Electron. Eng., China
Volume :
26
Issue :
8
fYear :
1990
fDate :
4/14/1990 12:00:00 AM
Firstpage :
541
Lastpage :
542
Abstract :
For original article see ibid., vol.25 p.324-5 (1989). In this comment, it is shown that the CPFFT is the same as the split radix FFT (SRFFT) algorithm from the arithmetic complexity point of view.
Keywords :
fast Fourier transforms; CPFFT; SRFFT; arithmetic complexity; conjugate pair; fast Fourier transform; split radix FFT;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19900351
Filename :
82734
Link To Document :
بازگشت