DSP Class on FFT

Why Fast Fourier Transform

Direct computation of DFT requires NxN complex multiplication and N(N-1) complex  addition – Hence it require more time

FFT utilizes the symmetry properties of trigonometric functions

FFT requires only N log N computation, hence the speed may increase in the order of logN/N

CLICK Here to Download ppt