David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
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
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996