Yao Qi, Raja Das, et al.
ISSTA 2009
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
Conference paper
Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum