Groups
Category
The Discrete Fourier Transform (DFT) converts a length-N sequence from the time (or spatial) domain into N complex frequency coefficients that describe how much of each sinusoid is present.
Convolution turns local pairwise combinations (like matching characters or adding two dice) into a single fast transform–multiply–inverse pipeline.