Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
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
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007