As DFT method is computationally slow ,we use Fast Fourier Transform (FFT). Due to less number of additions and multiplications required in FFT ,its implementation is fast. In this experiment , we studied FFT for 4 point and 8 point input signals. We used Radix-2 algorithm to perform this experiment.
Radix 2 algorithms give great results
ReplyDeleteFFT uses parallel processing.
ReplyDeleteFft cannot be used for real time processing
ReplyDeleteFFT of radix 2 divides the input into two N/2 pt DFT's. Similarly N/2 is divided into two N/4 sequences, decreasing the computations required, making it faster.
ReplyDeleteRadix two is preferred over radix three and other because it has less computations
ReplyDelete