Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
