Discrete Fourier Transform (general) - Definition

Definition

Let be any ring, let be an integer, and let be a principal nth root of unity, defined by:

  • for

The discrete Fourier transform maps an n-tuple of elements of to another n-tuple of elements of according to the following formula:

By convention, the tuple is said to be in the time domain and the index is called time. The tuple is said to be in the frequency domain and the index is called frequency. The tuple is also called the spectrum of . This terminology derives from the applications of Fourier transforms in signal processing.

If R is an integral domain (which includes fields), it is sufficient to choose as a primitive nth root of unity, which replaces the condition (1) by:

for

Proof: take with . Since, giving:

where the sum matches (1). Since is a primitive root of unity, . Since R is an integral domain, the sum must be zero. ∎

Another simple condition applies in the case where n is a power of two: (1) may be replaced by .

Read more about this topic:  Discrete Fourier Transform (general)

Famous quotes containing the word definition:

    The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.
    William James (1842–1910)

    The very definition of the real becomes: that of which it is possible to give an equivalent reproduction.... The real is not only what can be reproduced, but that which is always already reproduced. The hyperreal.
    Jean Baudrillard (b. 1929)

    Was man made stupid to see his own stupidity?
    Is God by definition indifferent, beyond us all?
    Is the eternal truth man’s fighting soul
    Wherein the Beast ravens in its own avidity?
    Richard Eberhart (b. 1904)