Friday, 22 April 2016

Discrete Fourier Transform


    The objective of this experiment was to develop a function for calculating DFT of  N-point signal.
This experiment was performed in C. Two separate code were written, one for 4-point and one for 8-point DFT.     8-point  DFT was calculated using 4-point DFT code. From this experiment we studied that, 
  1. As the value of N increases the frequency spacing also increases, i.e for 4-point DFT we got only 4 points in the magnitude plot where as in 8-point DFT we got 8 points in the magnitude plot between the range of (0-2pi).
  2. for the same 4 pt the 8 points inoint signal in 8-point DFT format got additional zero padding for next 4 points and hence we have got 8 points in the magnitude spectrum
Link for the C codes of this experiments are in the bellow drive link:
https://drive.google.com/open?id=0B-US8fsfaFQxMUdNbzRDbXppbXc

6 comments:

  1. DFT is easier as compared to FFT, programming wise, but practically, DFT is difficult to implement. And FFt can provide faster output.

    ReplyDelete
  2. Computation in FFT is varies logarithmically whereas in DFT it varies in direct proportion

    ReplyDelete
  3. DFT is slower as compared to FFT.

    ReplyDelete