Discrete time Fourier transform is computationally slow hence to increase the performance of the processors Fast Fourier Transform method is used gives the output with lesser number of calculations.The output was bit reversal of respective input signal.
In fft we divided the signal in N/2 equal parts even and odd. The even portion of the signal is added by the odd part which is multiplied by twiddle factor.Hence computations are reduced as calculation were done for N/2 length of signal.
The number of real addition,real multiplication, complex addition and complex multiplication was also calculated from the program using the counters.
FFT is computationally faster than DFT.
ReplyDeleteDFT is slower than FFT
ReplyDeleteFft makes use of parallel processing.
ReplyDeleteFft cannot be used for real time processing
ReplyDeleteFft is not suitable for real time signal
ReplyDeleteFFT is not suitable for real time processing without memory
ReplyDeleteThis comment has been removed by the author.
ReplyDeleteFFT cannot be used for real time signal
Delete