![]() |
$$ \mathrm{DFT}[k] = \sum_{n=0}^{N-1} \mathrm{x}[n] \cdot
e^{-\varphi\mathrm{i}} \\
where \quad \varphi = k \frac{n}{N} 2\pi
$$
|
Illustration 1. Caricature of Joseph Fourier by Julien-Léopold Boilly Note the Pythagorean doodle in the upper left and the Phasor doodle to the right. |
Equation 1. The Discrete Fourier Transform1 Don't panic. |
Although the classical notation of the Discrete Fourier Transform isn’t terribly approachable for learning purposes, it is a beautifully compact representation. It contains everything you need to know in order to implement and encode the transform. I personally think that it’s important to feel comfortable with the classical notation because you’ll continually encounter it when reading any paper or book related to signal processing. Most practicing scientists and engineers communicate with one another using these funny glyphs and symbols, so if you want to join in on the discussion you must be able to interpret the symbolic notation and relate it to your own mental models.2 In the next two sections we'll spend some time unpacking the classical notation and relating it to the concepts that we’ve already learned.