Fast fourier transform is fast method of computation than discrete fourier transform(DFT).It requires less number of calculation than Discrete Fourier Transform(DFT), which includes real addition and multiplication. FFT uses parallel processing hence it has high operation efficiency.In this experiment , we have taken cases of 4 point and 8 point sequence. The output of FFT is in bit reversed format. we have perfomed this experiment using C program of DITFFT(Decimation in time FFT).
fft is thus found to be easier than dft
ReplyDeleteFFT requires less computation thab DFT
ReplyDeleteParallel processing and less number of computations in FFT makes it faster and efficient than DFT
ReplyDeleteIn real time application, FFT is not used.
ReplyDeleteNumber of computations in FFT is less than that of DFT. This makes FFT computationally faster.
ReplyDeleteFFT is better than DFT computationally
ReplyDeleteHow do you get a real time parallel input?
ReplyDeleteGilbert Strang described the FFT as "the most important numerical algorithm of our lifetime"
ReplyDeleteReal time parallel input is not possible, the signal need to be stored in an array for parallel processing. Hence, FFT is not used for real time signal applications
ReplyDelete