Wednesday, 15 March 2017

Discrete Fourier Transform

Discrete Fourier Transform is the frequency sampled version of DTFT. To calculate DFT, the input sequence was assumed to be periodic. DFT for input length N=4 and N=8 was calculated. Output of DFT is periodic and it repeats after N values.Using Inverse DFT the input sequence was verified. Magnitude spectrum for N=4 and N=8 was plotted. It was found that increasing the number of inputs through zero padding increases the resolution of the magnitude spectrum.
Posted by at

7 comments:

  1. Unknown16 March 2017 at 21:54

    How is Dft the frequeny sampled version of DTFT?

    ReplyDelete
    Replies
    1. Unknown23 April 2017 at 05:08

      DTFT is a continuous signal and sampling this signal gives us DFT. X(k) is obtained by replacing w with 2*pi*k/N in X(w).

      Delete
  2. Meet Patel18 March 2017 at 07:32

    Short and simple

    ReplyDelete
  3. Unknown18 March 2017 at 07:38

    Is DFT computationally very efficient?

    ReplyDelete
    Replies
    1. Unknown23 April 2017 at 05:03

      DFT is not computationally efficient and so we use Fast Fourier Transform for signal processing which has higher computational efficiency

      Delete
  4. Just DSPP Things25 April 2017 at 22:18

    FFT is faster than DFT

    ReplyDelete
  5. Keshvi Srivastava25 April 2017 at 22:53

    Well written

    ReplyDelete

Subscribe to: Post Comments (Atom)