Publication | Closed Access
On the multiplicative complexity of discrete cosine transforms
57
Citations
22
References
1992
Year
Computational Complexity TheoryEngineeringScaled DctsAlgebraic ComplexityMultiplicative ComplexityComputational ComplexityTime ComplexityDiscrete Cosine TransformsDiscrete MathematicsApproximation TheoryIntegral Transform
The multiplicative complexity of discrete cosine transforms (DCTs) of arbitrary dimensions on input sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCTs on input sizes, which are powers of two, are also obtained.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1