Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
M.F. Cowlishaw
IBM Systems Journal
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014