FFT with reduced coefficient storage requirement

The factorization of the Fourier coefficients in the fast Fourier transform (FFT) is reexamined. The author presents a modified radix-2 FFT where the coefficient storage requirement is reduced by close to 50% if the coefficient memory cycle is half that of the operation cycle. This refactorization of the FFT coefficient is a generalization of the decimation in time (DIT) and decimation in frequency (DIF) FFT algorithms. The DIT and DIF are the two extremes of FFT twiddle coefficient factorization