Title :
Comment on ´Conjugate pair fast Fourier transform´
Author_Institution :
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
Abstract :
For original paper see ibid., vol.25, no.5, p.324-5 (1989). Suggests that the conjugate pair FFT (CPFFT) introduced is not superior to the split-radix FFT as claimed and explains why, and also refers to the theoretical minimum counts for multiplication for an FFT of length 2".
Keywords :
computational complexity; fast Fourier transforms; CPFFT; comment; conjugate pair FFT; minimum counts for multiplication; split-radix FFT;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19890725
