Skip to main content

Discrete Fourier Transform (DFT)

This experiment gave me an opportunity for relearning concepts of structures in C as I looked for methods to represent complex numbers in a C program other than using arrays. The resulting code was generalized and could be used for any arbitrary value of N.

Comments

  1. Unknown15 May 2018 at 22:38


    It is used over DTFT because the inverse of DFT can be calculated, but not of DTFT.

    ReplyDelete
  2. aniketwebslider15 May 2018 at 22:53

    DFT is used to obtain the frequency response of any time domain signal but FFT is used practically for fast computation.

    ReplyDelete
  3. Unknown15 May 2018 at 23:31

    DFT is practically used because its the sampled version(in frequency-domain) of DTFT , and computers can only handle finite values. It is Good that you are writing generalized code!

    ReplyDelete
  4. Unknown16 May 2018 at 08:14

    DFT always give periodic results and increasing the length by zero padding of the signal gives a better approximation of signal and resolution of spectrum increases

    ReplyDelete
  5. Unknown16 May 2018 at 10:20


    It's a useful program for testing and understanding the DFT process

    ReplyDelete

Post a Comment