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)
“Government ... thought [it] could transform the country through massive national programs, but often the programs did not work. Too often they only made things worse. In our rush to accomplish great deeds quickly, we trampled on sound principles of restraint and endangered the rights of individuals.”
—Gerald R. Ford (b. 1913)