Fast computation of discrete Fourier transforms using polynomial transforms (Q3886825)

From MaRDI portal
Revision as of 09:27, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast computation of discrete Fourier transforms using polynomial transforms
scientific article

    Statements

    Fast computation of discrete Fourier transforms using polynomial transforms (English)
    0 references
    0 references
    0 references
    1979
    0 references
    fast Fourier transform
    0 references
    Winograd Fourier Transform
    0 references
    minimum number of operations
    0 references
    efficient algorithms
    0 references
    two-dimensional discrete Fourier transform
    0 references
    polynomial transforms
    0 references
    Winograd's method
    0 references
    tables
    0 references
    flow-charts
    0 references
    short-length algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references