Monday, 20 March 2017

EXP 2 Discrete Fourier Transform

     DFT converts a finite sequence of equally spaced samples of a function into an equivalent length sequence of equally spaced samples of DTFT (discrete time Fourier transform) which is a complex valued function.
     It converts signal from time domain to frequency domain.It is used spectral signal analysis, data compression.
Posted by at

9 comments:

  1. Meet Patel25 April 2017 at 22:15

    The nature of the dft coeff after zero padding is such that for k= even, the values are same as that for N=4, and for K= odd the values get multiplied by twiddle factor.

    ReplyDelete
  2. Unknown28 April 2017 at 04:59

    DFT is obtained by sampling of DTFS

    ReplyDelete
  3. Unknown28 April 2017 at 04:59

    This comment has been removed by the author.

    ReplyDelete
  4. Unknown28 April 2017 at 05:13

    DFT is frequency sampling of DTFT

    ReplyDelete
  5. Unknown28 April 2017 at 05:16

    The complex multiplications and additions for the DFT are N^2 and N(N-1) respectively.

    ReplyDelete
  6. Unknown28 April 2017 at 05:26

    Discrete version of DTFT

    ReplyDelete
  7. Tony28 April 2017 at 05:41

    This method is slow due to many complex multiplications and additions

    ReplyDelete
  8. Ankesh Patil28 April 2017 at 06:09

    DFT is slow

    ReplyDelete
  9. Keshvi Srivastava28 April 2017 at 06:25

    Dft is slow as compared to fft

    ReplyDelete

Subscribe to: Post Comments (Atom)