Fast Fourier Transform (FFT)

As the input signal values increases the DFT computational time also increases. Thus to decrease this time, we have implemented DITFFT radix-2 algorithm for N=4 and N=8.
This algorithm decimates the input sample values into smaller pieces until the prime factor 2 is obtained.