This question already has an answer here:

I know this question has been asked before. It is, however, so confusing, that I'd like to give this another try: I have come across the following 2 definitions of the DTFT: enter image description here

So, the first line is the definition given in my lecture. The second line was given in a tutorial on the difference between DTFT and DFT. The first, obvious difference is the limit of the sum. While the first goes from -infinity to +infinity, the second treats a finite signal. I think DTFT are applied to infinite signals. Now, ,the second difference appears in the exponential function. In the second line, we are using small omega (2*pi*f) multiplied with n, which should be the sample index. In the first line we are using 2*pi*f divided by fs. I think the signal's highest frequency component divided by fs gives the number of samples. So... no, I still don't see the link to n. Can somebody please help me understand this? Although this question appears a lot in this forum?


marked as duplicate by Marcus Müller, MBaz, Matt L., lennon310, Peter K. Jan 14 at 15:45

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • $\begingroup$ @Marcus Müller: You're right, my question is more or less the same. However, can you tell me how to convert my first line (the large Omega) to the second line (small omega * n) ? I don't see how these two expressions are equal $\endgroup$ – user503842 Jan 12 at 18:37
  • $\begingroup$ @user503842 Why do you think they should be equal? These are two different transforms. Having said that, if you sample the DTFT, you get the DFT. $\endgroup$ – MBaz Jan 12 at 21:17

A DFT produces a finite number of results (frequency bins), so the complex result vector can be indexed by 0..(N-1).

A DTFT produces a result over a continuous range of frequencies (more than a finite number of results) so must be specified by a real number as opposed to an integer.

As MBaz says, you can sample the DTFT at a fixed integer number of points.

  • 2
    $\begingroup$ Note: Sampling of DTFT $X(e^{j \omega})$ into DFT $X[k]$ is only valid for finite length sequences. As the DTFT can also be defined for infinite length sequences such as $x[n]=a^n u[n] \longleftrightarrow X(e^{j\omega}) = \frac{1}{1-a e^{-j \omega}}$, sampling of the DTFT $X(e^{j\omega})$ is not a valid DFT now. @MBaz $\endgroup$ – Fat32 Jan 12 at 23:21

Not the answer you're looking for? Browse other questions tagged or ask your own question.