Tuesday, 14 March 2017

Discrete Fourier Transform

Second lab was based on DFT and IDFT. We have considered 2 cases. First case included calculation of 4 point DFT of input signal. Second case was appending the sequence x[n] by 4 zeros. DFT gives periodic result with period equal to N (length of input signal). We also performed IDFT (inverse discrete fourier transform) to find x[n] from X[k].

10 comments:

  1. Why DFT is preferred over DTFS needs to be emphasized.
    Disadvantage of DFT is that it maps real sequences into complex.
    Hence we go for DCT

    ReplyDelete
  2. DFT enables us to perform frequency domain analysis of Discrete signal

    ReplyDelete
  3. DFT has a continuous spectrum for non-periodic signals

    ReplyDelete
    Replies
    1. And it gives discrete spectrum for periodic signal.

      Delete
  4. A good overview of DFT algorithm.

    ReplyDelete
  5. Results of DFT can be stored in memory.

    ReplyDelete