Abstract
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. >
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
