Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Paper
On the Multiplicative Complexity of Discrete Cosine Transforms
Abstract
The multiplicative complexity of discrete cosine transforms (DCT’s) of arbitrary dimensions on inputs sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCT’s on input sizes, which are powers of two, are also obtained. © 1992 IEEE
Related
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009