In this experiment FFT of 8 point signal was performed .Problem occured while implementing the logic but that was rectified later.Here the length of input signal and signal values were taken from user. X[K] using FFT and x(n) by IFFT was calculated. In FFT calculations takes place in parallel manner. Also there are less number of complex additions and multiplication, hence the number of calculations is drastically reduced. Therefore FFT is much faster than DFT.
FFT-1
FFT-2
IFFT-1
IFFT-2
FFT-1
FFT-2
IFFT-1
IFFT-2
Fast Fourier Transform algorithm requires all values of the input signal to be given to give the output.
ReplyDeleteHas advantage over DFT on number of computational steps.
DeleteFFT proved much faster than DFT
ReplyDeleteThe number of complex multiplication ,complex addition ,real multiplication and real addition are very less for FFT as compared to DFT
Delete