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:
“We have good reason to believe that memories of early childhood do not persist in consciousness because of the absence or fragmentary character of language covering this period. Words serve as fixatives for mental images. . . . Even at the end of the second year of life when word tags exist for a number of objects in the child’s life, these words are discrete and do not yet bind together the parts of an experience or organize them in a way that can produce a coherent memory.”
—Selma H. Fraiberg (20th century)
“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)