Discrete Fourier Transform

Discrete Fourier Transform(DFT)

        Discrete Fourier Transform is the frequency sampled version of Discrete Time Fourier Transform. Thus, it involves finding the finite set of values .It gives periodic results. This theory is implemented in our practical session.

         Here, we first take a 4 point input x(n) and find its DFT. Finally, we plot its magnitude spectrum by approximation. This process is followed for 8 point sequence- by appending zeros at the end or by placing them at alternate positions in the sequence.This is done by generating a code in C language and displaying the executed result on the Terminal. After execution and value verification of all 3 cases we study the magnitude spectrum pattern. Thus, we infer that as the length of the signal increases the frequency spacing and error decreases.Then we move to the analysis of this method by considering all computations(addition and multiplications) involved and prove that it is slow method.