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

Read More

DSP Class slide

Dear Students


A DFT is a Fourier that transforms a discrete number of samples of a time wave and converts them into a frequency spectrum.


             You can download the presentation on Discrete Fourier Transform by clicking here

CLICK Here

Read More