Discrete Fourier Transform

Discrete Fourier Transform  ( DFT )  is used to convert from time domain to frequency domain. We calculated DFT of a four point sequence , zero paded signal and an expanded signal. Magnitude spectrum was plotted as well for all the cases.

It was observed that as the length of the signal increases, frequency spacing decreases , approximation error decreases while the resolution of spectrum increases. Along with this the number of multiplications and additions also increase which is why DFT is computationally slow