Search⌘ K
AI Features

DFT Definition

Explore the definition of the Discrete Fourier Transform (DFT) and understand how it analyzes the frequency components of discrete-time signals. Learn how the DFT uses correlation with complex sinusoids to reveal the signal's spectrum, focusing on both complex and real signals and their frequency domain representation.

Using our knowledge of complex signals and correlation, we can understand how the DFT helps us observe the spectrum of any signal.

Complex signals

Let’s start with a discrete-time complex sinusoid ej2πkNne^{j2\pi \frac{k}{N}n} that has a discrete frequency of k/Nk/N. For a time domain signal x[n]x[n], the DFT is defined as follows:

X[k]=n=0N1x[n]ej2πkNnX[k]=\sum_{n=0}^{N-1}x[n]e^{-j2\pi\frac{k}{N}n}

While this might look intimidating, the process becomes easier to understand if the following conventions with regard to the variables are kept in mind:

  • X[k]X[k] is the kk-th DFT output.
  • kk is the DFT output index in frequency domain, and it ranges from 00 to N1N-1 or N/2-N/2 to N/21N/2-1. Both are appropriate ranges since the frequency samples after N/2N/2 are simply repeated on the left side too.
  • The time domain index is represented, as before, by n
...