Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Andrew Skumanich
SPIE Optics Quebec 1993
L Auslander, E Feig, et al.
Advances in Applied Mathematics
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989