Convolution
The sliding-overlap operation that blends two signals — and which, magically, becomes simple multiplication in the frequency domain.
Convolution
Convolution is the operation that slides one signal across another, multiplying and accumulating the overlap at every shift. For two signals f and g:
Intuitively, g is a little kernel — a stencil — that you drag along f; at each position the output is the area of their overlap. Smear a signal with a blob-shaped kernel and you blur it; smear it with a kernel that has positive and negative parts and you sharpen or differentiate it. Every linear filter — every blur, echo, equalizer, and edge detector — is a convolution.
The kernel sliding across the signal
Below, a bump-shaped kernel (the moving highlight) slides left to right across a two-peak signal (top). At each position the running output (bottom) records how much the kernel currently overlaps the signal. Where the kernel sits on a peak, the output rises; between peaks, it dips.
The convolution theorem
Convolution looks expensive — a sliding integral at every point — yet the Fourier Transform collapses it into something trivial. Convolution in time is multiplication in frequency, and vice versa:
This is the engine of practical signal processing. To filter a signal, you do not laboriously slide a kernel across it; you transform to the Frequency Domain, multiply by the filter's response, and transform back. A blur becomes "attenuate the high frequencies"; an echo becomes "boost a comb of frequencies." The hard operation in one domain is the easy one in the other.