Fast Fourier Transform(FFT) has less number of addition and multiplication.Therefore,it is faster than Discrete fourier Transform (DFT).Cooley and Tuckey's radix-2 Decimation In Time Fast Fourier Transform ( DITFFT) was performed,where the term decimation means nothing but sampling.
The FFT algorithm divides the N point signal into 2 parts i.e even and odd.Decomposition reduces the calculation.FFT of 4 point and 8 point sequences was calculated using radix 2 algorithm.Bit reversal technique was observed.
What does radix 2 algorithm mean ?
ReplyDeleteRadix 2 means that the number of samples must be an integral power of two.
DeleteThank you
FFT involves decimation..therefore it would reduce calculation when compared to DFT.
DeleteFaster compared to DFT
ReplyDeleteBecause of parallel processing FFT is more faster than DFT
ReplyDeleteFFT is parallel processing
ReplyDeleteYes it is very efficient.
DeleteWell explained
ReplyDeleteFFT is like sample part of DFT
ReplyDeleteFFT is implemented by radix based sampling
ReplyDelete