DSPP Practicals
FFT (Fast Fourier Transform) has less no. of computations (real and complex addition and multiplication) than DFT, hence it was implemented.
There are two types of FFT viz. DIT-FFT (Decimation In Time FFT) and DIF-FFT (Decimation In Frequency FFT) out of which we implemented DIT-FFT using C.
The input signal we used for computing FFT was the same as that used in DFT. It was seen that the output in both the cases was same which proves that DFT and FFT produce same results.
This helps to reduce the execution time
ReplyDeleteyes, because the computations are less in case of fft
Deleteorder of ip and op is inverse in dit-fft and dif-fft
ReplyDeleteyes, in dit-fft op is ordered and in dif-fft op is ordered
DeleteFFT is faster
ReplyDelete