The aim which has to be achieved and the contents of this experiments are as follows :
Fast Fourier Transform
we have undertook two cases :
Case 1 : N=4
Case 2 : N=8
after which we obtsain complex multiplication, complex addition, real multiplication, real addition for analysis and comparision between DFT and FFT
through which we conclude, Thus by using FFT we can reduce number of computation as compared to DFT. We can compare number of computations which help us in deciding the better method.
link : https://drive.google.com/open?id=0BxKOmgoubcmEMmg2b3pJSmFBbzg
Fast Fourier Transform
we have undertook two cases :
Case 1 : N=4
Case 2 : N=8
after which we obtsain complex multiplication, complex addition, real multiplication, real addition for analysis and comparision between DFT and FFT
through which we conclude, Thus by using FFT we can reduce number of computation as compared to DFT. We can compare number of computations which help us in deciding the better method.
link : https://drive.google.com/open?id=0BxKOmgoubcmEMmg2b3pJSmFBbzg
FFT is preferred over DFT as less number of real and complex multiplications and additions are needed in FFT algorithms.
ReplyDeleteFFT's complexity is lower than DFT as for N-point FFT, system should compute for (N/2)log(N) but for DFT it computes N2 times.
ReplyDelete