Chebyshev polynomial derivation of composite-length DCT algorithms (Q1196223)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chebyshev polynomial derivation of composite-length DCT algorithms |
scientific article; zbMATH DE number 77904
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chebyshev polynomial derivation of composite-length DCT algorithms |
scientific article; zbMATH DE number 77904 |
Statements
Chebyshev polynomial derivation of composite-length DCT algorithms (English)
0 references
17 December 1992
0 references
This paper provides fast algorithms for the discrete cosine transform (DCT) of different single- and mixed-radix lengths by using a polynomial approach to the DCT which is mainly based on the properties of Chebyshev polynomials.
0 references
fast polynomial algorithm
0 references
fast algorithms
0 references
discrete cosine transform
0 references
single- and mixed-radix lengths
0 references
Chebyshev polynomials
0 references
0.84095323
0 references
0.8326473
0 references
0 references
0.8256585
0 references
0.8253428
0 references
0.8200149
0 references
