FAST FOURIER TRANSFORM
Fast fourier transform(FFT) is a fast method of computation than Discrete fourier transform(DFT) as FFT has less number of additions(both real and complex) and multiplications(both real and complex) involved.Operational efficiency of FFT is high as it uses parallel processing.Also the output of FFT is in bit reversed form.In this practical,two cases were considered by taking 4 point and 8 point input sequences.The output was found using C program which implemented DITFFT(Decimation in time FFT) algorithm.
FFT requires lesser computation
ReplyDeleteFFT is faster than DFT as parallel processing is done in FFT
ReplyDeleteAll DSP processors include a hardware bit reversal indexing capability.
ReplyDeleteDFT requires more computations
ReplyDeleteFFT is better than DFT
ReplyDeleteFFT is better than DFT
ReplyDeleteFast Fourier Transform is more effective in a practical approach when code is executed and implemented
ReplyDeleteNumber of computations in FFT is less than that of DFT. This makes FFT computationally faster.
ReplyDeleteFast Fourier Transform are not suitable for real time applications. FFT algorithms are implemented using parallel processing techniques.
ReplyDelete