Key points are not available for this paper at this time.
An alternative form of the fast Fourier transform (FFT) is developed. The new algorithm has the peculiarity that none of the multiplying constants required are complex-most are pure imaginary. The advantages of the new form would, therefore, seem to be most pronounced in systems for which multiplication are most costly.
Rader et al. (1976) studied this question.