Discrete Fourier Transform

This was an experiment with lots of learning experience. In this experiment previous C programming concepts were also covered like function calling using call by value and call by reference method. DFT is the frequency domain representation of the original input sequence. DFT signal output is always periodic. Using DFT we can reduce approximation errors and also resolution of the spectrum can be increased. DFT results has high accuracy due to periodicity. So if your signal is not periodic it has to be assumed periodic to get better and accurate results.

The limitation of DFT is that it is slow for real time processing due to lots of real and complex calculations. So to overcome this problem we use FFT-Fast Fourier Transform.