Raymond Wu, Jie Lu
ITA Conference 2007
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
Raymond Wu, Jie Lu
ITA Conference 2007
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989