Fast and numerically stable algorithms for discrete cosine transforms (Q1765902): Difference between revisions

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:35, 5 March 2024

scientific article
Language Label Description Also known as
English
Fast and numerically stable algorithms for discrete cosine transforms
scientific article

    Statements

    Fast and numerically stable algorithms for discrete cosine transforms (English)
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    The authors deal with fast cosine transform algorithms from the stability point of view. Their algorithm is based on a factorization of cosine matrices into sparse, almost orthogonal matrices. This is the due to achieve a better numerical stability than previous fast cosine transforms without orthogonal factors.
    0 references
    fast discrete cosine transform
    0 references
    numerical stability, factorization of DCT matrices into sparse matrices
    0 references
    algorithm
    0 references

    Identifiers