Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
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
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Oliver Bodemer
IBM J. Res. Dev
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996