DITFFT was studied for two cases – 4-point
signal and 8-point signal. FFT algorithm was compared to DFT by counting the
computations required in both cases. Computations were found to reduce drastically for greater number of points in the signal. The process of FFT is
a parallel computing one, mathematically, and hence, it is found to be fast. Also, the concept
of bit reversal sequences at the input and output was observed.
