In this experiment we learnt Fast Fourier Transform (FFT)
This is also a computational method like Discrete Fourier Transform (DFT) but is faster than it, hence the name Fast Fourier Transform (FFT)
The calculation of odd and even parts are done parallely and this reduces the total number of operations of addition and subtraction of real and imaginary parts. We performed FFT of 4pt and 8pt signals using Radix 2 algorithm which accounts for parallel computation and hence increases efficiency and faster calculation time.
This is also a computational method like Discrete Fourier Transform (DFT) but is faster than it, hence the name Fast Fourier Transform (FFT)
The calculation of odd and even parts are done parallely and this reduces the total number of operations of addition and subtraction of real and imaginary parts. We performed FFT of 4pt and 8pt signals using Radix 2 algorithm which accounts for parallel computation and hence increases efficiency and faster calculation time.
Why do we used dft?
ReplyDeleteDFT is frequency sampling of DTFT and its values can be stored but is less efficient than FFT
DeleteThis comment has been removed by the author.
ReplyDeleteFFT is computationally faster than DFT.
ReplyDeleteYes, it is a parallel processing technique
DeleteFFT can compute the same DFT in only O(N log N) operations
ReplyDeleteThat determines the efficiency
DeleteFFT has less calculations and is faster than DFT.
ReplyDeleteThat is why it is used so widely
Delete