Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
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
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Thomas M. Cheng
IT Professional
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine