Discrete Fourier Transform (general)
This article is about the discrete Fourier transform (DFT) over any ring, commonly called a number-theoretic transform (NTT) in the case of finite fields. For specific information on the discrete Fourier transform over the complex numbers, see discrete Fourier transform.
Read more about Discrete Fourier Transform (general): Definition, Inverse, Matrix Formulation, Polynomial Formulation, Properties, Fast Algorithms
Famous quotes containing the words discrete and/or transform:
“The mastery of one’s phonemes may be compared to the violinist’s mastery of fingering. The violin string lends itself to a continuous gradation of tones, but the musician learns the discrete intervals at which to stop the string in order to play the conventional notes. We sound our phonemes like poor violinists, approximating each time to a fancied norm, and we receive our neighbor’s renderings indulgently, mentally rectifying the more glaring inaccuracies.”
—W.V. Quine (b. 1908)
“But I must needs take my petulance, contrasting it with my accustomed morning hopefulness, as a sign of the ageing of appetite, of a decay in the very capacity of enjoyment. We need some imaginative stimulus, some not impossible ideal which may shape vague hope, and transform it into effective desire, to carry us year after year, without disgust, through the routine- work which is so large a part of life.”
—Walter Pater (1839–1894)