EXP 3. FAST FOURIER TRANSFORM

IN this experiment ,we have implemented function in c language for  finding DITFFT for real valued sequence as well as for complex valued sequence.

There are two types  Radix 2 algorithm of FFT as follows:
1.DIT-FFT(Decimation in time domain FFT)

2.DIF-FFT(Decimation in frequency domain FFT)

Here we used  DIT-FFt algorithm (Cooley & Tukey’s DIT-FFT Algorithm).IF we consider computational efficiency ,FFT is comparatively faster than DFT  as total real multiplication and total real addition in FFT are less than DFT.

Applications of FFT:

1.Linear FIR Filter.

2. Linear Convolution method.