Fast and numerically stable algorithms for discrete cosine transforms (Q1765902)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2137786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and numerically stable algorithms for discrete cosine transforms |
scientific article; zbMATH DE number 2137786 |
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
0 references
0 references
0.9154839515686036
0 references
0.8754066228866577
0 references
0.8634347319602966
0 references
