Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
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
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
M. Tismenetsky
International Journal of Computer Mathematics
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings