Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
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
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization