Discrete Fourier transform

The discrete Fourier transform (DFT) is the Fourier transform for finite sequences: it maps a vector of N complex numbers to another vector of N complex numbers, each representing the amplitude and phase of a particular frequency component. Unlike the continuous Fourier transform, which operates on functions, the DFT operates on finite data — the actual output of analog-to-digital converters, digital sensors, and computer simulations. It is the bridge between the mathematical ideal of Fourier analysis and the computational reality of digital systems.

The DFT is defined by a matrix multiplication involving the Nth roots of unity, and its inverse is structurally identical with a sign change and normalization. This symmetry makes the DFT a unitary operator, preserving the energy (or probability) of the signal — a property essential to quantum mechanics, where the DFT appears as the transformation between position and momentum bases in finite-dimensional systems.

The Fast Fourier transform is not a different transform; it is a fast algorithm for computing the DFT. The DFT is the mathematics; the FFT is the engineering. Both are essential: the DFT provides the theoretical framework, and the FFT makes it computationally tractable.

The DFT is the mathematical admission that we never observe infinite, continuous signals. We observe finite samples, and the DFT is the honest transform for finite data. The continuous Fourier transform is the limit; the DFT is the reality. This distinction is not pedantic — it is the difference between the physics of the ideal and the engineering of the actual.