Comment on ´Conjugate pair fast Fourier transform´

For the original article see ibid., vol.25, no.5, p.324-5 (1989). Kamar and Elcherif have proposed an algorithm for computation of the discrete Fourier transform which they called a conjugate pair fast Fourier transform (CPFFT). The main idea of the algorithm, which concerns the grouping of twiddle factors into complex-conjugate pairs, holds true on the whole. However, the commenters point out that it does not allow a reduction of real multiplications and additions as compared with FFT algorithms of a split-radix type, as the authors assert.