In this experiment FFT of 8 point signal was performed and 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
FFT requires (NlogN/2) - to the base 2 - number of complex multiplications and NlogN - to the base 2 - number of complex additions.
ReplyDeleteFFT is faster algorithm than DFT as number of Complex/Real Additions & Multiplications are reduced
DeleteFFT is faster than DFT due to less no of calculations.
ReplyDeleteYes that's why this method is most preferred method
Delete