Fast and numerically stable algorithms for discrete cosine transforms (Q1765902): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55970224, #quickstatements; #temporary_batch_1707252663060 |
Removed claims |
||
| Property / author | |||
| Property / author: Gerlind Plonka-Hoch / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Gabriele Drauschke / rank | |||
Revision as of 05:57, 20 February 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
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
