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
David A. Selby
IBM J. Res. Dev
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009