bn:03770007n
Noun Concept
Categories: Numerical analysis, Discrete transforms, Digital signal processing, Unitary operators, Fourier analysis
EN
discrete Fourier transform  centered DFT  Circular convolution theorem  Circular cross-correlation  Cross-correlation theorem
EN
In mathematics, the discrete Fourier transform converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform, which is a complex-valued function of frequency. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the discrete Fourier transform converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform, which is a complex-valued function of frequency. Wikipedia
Occasionally called the finite Fourier transform, the Fourier transform of a discrete periodic sequence, which can also be thought of as the DTFT of a finite-length sequence evaluated at discrete frequencies Wikipedia Disambiguation
The process of converting a discrete time-based function into its frequency-based representation. Wiktionary
Math: a conversion process. Wiktionary (translation)