The aim of this experiment is to
perform Fast Fourier Transform of a signal. The fast Fourier transform (FFT) is
a discrete Fourier transform algorithm which reduces the number of computations
needed for 
points from 2N^2 to 2logN of DFT.
points from 2N^2 to 2logN of DFT.
In this experiment, we calculated the
FFT of a signal with N=4. The FFT algorithm was developed in C language and the
output was obtained. The number of computations for DFT and FFT were compared. FFT reduces the computation time because of decomposition techniques and hence is preferred over DFT.
You can refer to code for FFT and IFFT by clicking on the link below.
https://drive.google.com/drive/folders/0B9Ily3Urp8vgVTZ3cTdrdzA3RTg
why FFT is more preferable than DFT?
ReplyDeleteFFT produces fast results. This is because the calculations are reduced by decomposition technique. Also, FFT algorithms are implemented using parallel processing techniques. Hence FFT is preferable over DFT
DeleteFFT produces fast results because calculations are reduced by decomposition techniques.
ReplyDeleteIn FFT, N pt DFT is decomposed into two N/2 pt DFT's, N/2 point DFT is decomped into N/4 pt DFT's and so on...
Decomposition reduces calculations.
spectrum improves as no. of sample points increases
ReplyDeleteThis comment has been removed by a blog administrator.
ReplyDeleteThis comment has been removed by a blog administrator.
ReplyDelete