The multiplicative complexity of discrete cosine transforms

Ephraim Feig; Elliot Linzer

doi:10.1016/0196-8858(92)90023-P

Advances in Applied Mathematics

Paper

01 Jan 1992

The multiplicative complexity of discrete cosine transforms

View publication

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.

Paper

Hadamard Transforms on Multiply/Add Architectures

Don Coppersmith, Ephraim Feig, et al.

IEEE TSP

Paper

Quantum Simulators: Architectures and Opportunities

Ehud Altman, Kenneth R. Brown, et al.

PRX Quantum

Conference paper

Optimization of real phase-mask performance

F.M. Schellenberg, M. Levenson, et al.

BACUS Symposium on Photomask Technology and Management 1991

Paper

Can one always lower topological entropy?

M. Shub, B. Weiss

Ergodic Theory and Dynamical Systems

View all publications

Abstract

Related

Hadamard Transforms on Multiply/Add Architectures

Quantum Simulators: Architectures and Opportunities

Optimization of real phase-mask performance

Can one always lower topological entropy?