The third experiment performed by us was Fast Fourier Transform. The input was for N=4 i.e 4 point FFT. Its Fast Fourier Transform was obtained and the was stored in X[k]. Also IFFT was done too on the output of the first part of this experiment.
Comparision between DFT and FFT was done based on few parameters like Complex Multiplicatio, Complex Addition, Real Multiplication, Real Addtition and from the table it was seen that from the perspective of arithmetic computations the number of arithmetic calculationsin FFT are less than DFT and hence FFT is faster than DFT.
It was also observed that Fast Fourier Transform algorithm requires all values of the input signal to give the output.
https://drive.google.com/open?id=0B8F3pY6H1pIWVlRWU3J3SjV4YUk
http://preranasarode1995.blogspot.com/2016/04/fft.html
FFT uses parallel processing.
ReplyDeleteFFT is faster because number of computations are reduced in it as compared to DFT.
ReplyDeleteYes but it cannot be used for real time applications because the entire signal is not available at the same time so we need to process small segments of data available and then combine to form the longer sequence.
ReplyDelete