Fast Fourier Transform

 The aim of this experiment was to perform FFT of N point signal (N=4).From this experiment we studied that,

1. we used a code in C to perform fast Fourier transform of a N point signal.We learnt that as the number of complex as well as real additions and multiplications reduces in FFT, the computational efficiency increases resulting to a shorter time required to compute the Fourier transform.
2. The FFT algorithm is faster then DFT as it requires less number of iteration.
3. we also generated code for the inverse FFT.

 C codes of this experiments are available in drive  :
https://drive.google.com/open?id=0B-US8fsfaFQxSkhGaURVYy1sYTA