Daniel M. Bikel, Vittorio Castelli
ACL 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
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024