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

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
label / enlabel / en
 
A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
Property / author
 
Property / author: Gabriele Drauschke / rank
Normal rank
 
Property / author
 
Property / author: Gabriele Drauschke / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2008542 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4256167030 / rank
 
Normal rank
Property / title
 
A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms (English)
Property / title: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms (English) / rank
 
Normal rank

Latest revision as of 21:01, 19 March 2024

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