Y.Y. Li, K.S. Leung, et al.
J Combin Optim
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
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Matthew A Grayson
Journal of Complexity
Yi Zhou, Parikshit Ram, et al.
ICLR 2023