For finding DFT for large signal we use FFT which divides N point signal into two equal parts with each part consists of alternate values. This division process was done till no further division could be possible. The output obtained was in bit reversal order which we arranged the so that no confusion should be made while reading the output. We perform this experiment for four point signal and eight point signal hence the algorithm used is radix-2. Later we checked the number of calculation using counter. The number of calculations were reduced.
FFT uses parallel processing.
ReplyDeleteRadix2 fft is faster than radix3
ReplyDeleteFFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for quick multiplication of large integers.
ReplyDeleteNumber of computations required are less, thus speed increases.
ReplyDeleteFFT is faster than DFT.
ReplyDeleteFft cannot be used for real time processing
ReplyDeleteBecause of parallel processing FFT is more faster than DFT
ReplyDeleteNumber of computations in FFT is less than that of DFT. This makes FFT computationally faster.
ReplyDelete