A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms (Q5203648)

From MaRDI portal
Revision as of 21:01, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4197370
Language Label Description Also known as
English
A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
scientific article; zbMATH DE number 4197370

    Statements

    0 references
    0 references
    1991
    0 references
    fast Fourier transform
    0 references
    polynomial arithmetic
    0 references
    fast algorithms
    0 references
    discrete Fourier-cosine transform
    0 references
    discrete Fourier-sine transform
    0 references
    discrete cosine transform
    0 references
    A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms (English)
    0 references

    Identifiers

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