Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
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
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences