As DFT is computationally is slow, in order to reduced the calculations and increase the speed drastically, Fast Fourier Transform i.e FFT was introduced. In theory sessions,we learnt Radix-2 FFT algorithms.
In this lab session we studied and executed FFT of 4pt and 8pt sequence using DITFFT. We also calculated the no. of computations required to find out FFT of a sequence. Comparing it with no.of computations required of DFT we concluded that FFT is much faster compared to DFT.
In this lab session we studied and executed FFT of 4pt and 8pt sequence using DITFFT. We also calculated the no. of computations required to find out FFT of a sequence. Comparing it with no.of computations required of DFT we concluded that FFT is much faster compared to DFT.
This is well connected with the theory
ReplyDeleteIn class we found out that no. of calculations where reduced in FFT as compared to DFT.
DeleteFFT is faster method than DFT.
ReplyDeleteFast Fourier Transform is more effective in a practical approach when code is executed and implemented
ReplyDeleteYes, since parallel computing is possible.
DeleteBecause of parallel processing FFT is more faster than DFT
ReplyDeleteNumber of calculations reduces in FFT
ReplyDelete