Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB
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
Strong and flexible domain typing for dynamic E-business
Yigal Hoffner, Simon Field, et al.
EDOC 2004
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)