An algorithm for fast computation of DFT is FFT(Fast Fourier Transform).The
FFT algorithm divides the N-point DFT input signal into 2 parts-even and odd
signal
We performed 4-point and 8-point FFT. Then we verified the answer by
performing Inverse FFT for both.
Later, number of calculations involved in FFT and DFT were compared and we
found that very fewer calculations are required for FFT. Hence, FFT is used for
parallel processing as it improves operational efficiency.
State the Limitations of FFT algorithm?
ReplyDeleteThe limitations of DFT is that it cannot be used for real time applications and also it cannot be used for filtering of long data sequence.
DeleteWhy FFT cannot be used for real time applications?
DeleteFFT algorithms are implemented using parallel processing techniques. When FFT is used input is applied in parallel i.e simultaneously. For real time applications entire input signal is not available. So FFT algorithms can not be used.
Deletewell written. Bit reversal is inolved in FFT
ReplyDeleteYes. Which can also be implanted in hardware using DSP processor which makes the execution faster
DeleteIt is computationally efficient than DFT
ReplyDeleteYes because parallel processing takes place
DeleteFFT reduces complex multiplications by decimating the signal to a lower radix.
ReplyDeleteYes
DeleteBecause of parallel processing FFT is more faster than DFT.
ReplyDeleteYeah. And also it's computationally more efficient and required less of complex addition and multiplication as compared to DFT
DeleteDFT is used in FSM which involves computation at fixed values of frequency. Hence, it is preferred.
ReplyDeleteYes thanks for the Information
Deletethe signal is divided into 2 parts, so the computation is carried out only for N/2 signal values
ReplyDeleteYes.
DeleteCan you post why FFT is faster than DFT?
ReplyDeleteFFT algorithms are implemented using parallel processing techniques. Hence FFT is faster as compared to DFT
DeleteWhat are the different algorithms for performing a FFT?
ReplyDeleteThe different algorithms for FFT are decimation in time and decimation in frequency
ReplyDelete