WikiRNG
Rolled Version rolled

Discrete Fourier transform over a ring

Generalisation of Fourier transform to any ring

In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring.

ObscureTop 16%
115,340SP

Badges26 earned

  1. Problem SetObscure+49,612 SP
    Has 20+ math formulas. ยท 187 formulas
  2. arXivObscure+18,792 SP
    Links to arXiv.
  3. EquationObscure+17,530 SP
    Has a math formula.
  1. Says Who?Notable+9,100 SP
    Has a "who?", "when?", "which?" or "clarify" tag.
  2. Part of a SeriesNotable+3,597 SP
    Has a series sidebar.
  3. JSTORNotable+3,582 SP
    Links to JSTOR.
  4. Nested DeeperNotable+2,329 SP
    Has sub-subsections.
  5. Free to ReadNotable+1,728 SP
    Cites a source that is free to read.
  6. Five-Minute ReadNotable+1,371 SP
    1,200+ words of prose. ยท 1,612 words
  7. PigeonholedNotable+1,113 SP
    In exactly one category.
Basic16
rolled by stellarcrystal

the values are complex. transform the function, commonly