In this lab session we performed FFT and IFFT. We performed 4-point and 8-point FFT. FFT algorithms are based on the fundamental principle of decomposing computation of the discrete fourier transform of a sequnce of length N into successively smaller discrete fourier transforms. As compared to DFT, FFT is much faster.
Is there any way to get both output and input in proper order (not bit reversed order as in DITFFT and DIFFFT) ?
ReplyDeleteWhat should be the modification?
Short explaination... Bt informative...
ReplyDeleteShort explaination... Bt informative...
ReplyDeleteThanks
DeleteFFT is computationally more efficient than DFT since input is decomposed and computations are done parallely
ReplyDeleteFFT is better than DFT
ReplyDeleteYes as the decomposition reduces calculation
DeleteFFT is the most widely used transform.
ReplyDeleteTrivial computations are avoided in this algorithm hence computations get reduced.
ReplyDelete