David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
The multiplicative complexity of discrete cosine transforms
Abstract
We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms. The latter have all been determined previously. © 1992.
Related
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics