The multiplicative complexity of discrete cosine transforms

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Feig, E., & Linzer, E. (1992). The multiplicative complexity of discrete cosine transforms. Advances in Applied Mathematics, 13(4), 494–503. https://doi.org/10.1016/0196-8858(92)90023-P

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free