Fast Fourier transform (Q623950)

From Wikidata
Jump to navigation Jump to search
O(N logN) divide and conquer algorithm to calculate the discrete Fourier transforms
  • FFT
edit
Language Label Description Also known as
default for all languages
No label defined
    English
    Fast Fourier transform
    O(N logN) divide and conquer algorithm to calculate the discrete Fourier transforms
    • FFT

    Statements

    short name
    FFT (English)
    0 references
    БПФ (Russian)
    0 references
    TFR (French)
    0 references
    developer
    John Tukey
    0 references
    Commons category
    FFT
    0 references

    Identifiers

    GND ID
    4136070-9
    0 references
    Enciclopedia della Scienza e della Tecnica ID
    fft
    subject named as
    FFT (Fast Fourier transform)
    author name string
    Lorenzo Seno
    publication date
    2008
    0 references
    GitHub topic
    fast-fourier-transform
    1 reference
    reference URL
    https://github.com/topics/fast-fourier-transform
    title
    fast-fourier-transform · GitHub Topics · GitHub (English)
    retrieved
    25 July 2021
    fft
    1 reference
    reference URL
    https://github.com/topics/fft
    title
    fft · GitHub Topics · GitHub (English)
    retrieved
    25 July 2021
    Treccani ID
    fft
    subject named as
    FFT
    0 references
     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                    Retrieved from "https://www.wikidata.org/w/index.php?title=Q623950&oldid=2306476728"