The multiplicative complexity of discrete cosine transforms (Q1802353)
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: The multiplicative complexity of discrete cosine transforms |
scientific article; zbMATH DE number 203287
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The multiplicative complexity of discrete cosine transforms |
scientific article; zbMATH DE number 203287 |
Statements
The multiplicative complexity of discrete cosine transforms (English)
0 references
21 July 1993
0 references
Multiplicative complexity of the discrete cosine transforms is evaluated in relation to that of the discrete Fourier transforms. The complexity measure is defined here to be the minimum number of non-rational multiplications required to compute jointly the real and imaginary outputs of the product of an arbitrary real vector by a complex matrix.
0 references
tensor product
0 references
direct sum
0 references
Multiplicative complexity
0 references
discrete cosine transforms
0 references
discrete Fourier transforms
0 references
