Conjugate pair fast Fourier transform
I. Kamar, Y. Elcherif · Electronics Letters · 1989
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-2m DFT. The number of multiplications and additions required by the CPFFT is less than that required by the SRFFT algorithm.