discrete Fourier transform
You are here: irt.org | FOLDOC | discrete Fourier transform
<mathematics> (DFT) A Fourier transform, specialized to the
case where the abscissas are integers.
The DFT is central to many kinds of signal processing,
including the analysis and compression of video and sound
A common implementation of the DFT is the Fast Fourier Transform (FFT).
See also discrete cosine transform.
Nearby terms: Discordianism « discrete « discrete cosine transform « discrete Fourier transform » discrete preorder » discriminated union » discussion group
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb