Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
G. Ramalingam
Theoretical Computer Science
Gal Badishi, Idit Keidar, et al.
IEEE TDSC