FFT

The aim of the experiment was to perform fast fourier transform of a 4 point sequence. The program was written in C language.

In this experiment, we observed that the number of calculations in FFT are less than that in DFT. Thus, FFT is faster.The number of calculations to implement the DFT equation directly is proportional to N*N, where N is the number of data points. The FFT algorithm reduces this to a number proportional to NlogN where the log is to base 2. 

Link for the codes:

https://drive.google.com/folderview?id=0B9FCQ_loE3PaUVJLamtVRWdkLU0&usp=sharing