Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
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
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking