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
Preeti Malakar, Thomas George, et al.
SC 2012
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Gal Badishi, Idit Keidar, et al.
IEEE TDSC