In this experiment we had to develop a program to perform FFT and IFFT of an N point signal . Here I considered N=4
So for N=4 with x(n)={10,11,12,13 } , I obtained X[k]={46,-2+2j,-2,-2-2j} on performing FFT and vice versa for IFFT .
So thus I learnt that the number of arithmetic calculations in FFT are very less as compared DFT . Hence FFT is a faster method .
link for the code : https://drive.google.com/drive/folders/0BwYB93kRygZnT1E1MUNaZXh4RGM
Number of computations required are less, thus speed increases.
ReplyDeleteIt seems FFT is very much preferable over DFT.
ReplyDeleteDo you have any doubt about efficiency of FFT?
DeleteCan you post why FFT is faster than DFT?
FFT is faster than DFT as operations in FFT are independant.
ReplyDelete