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

Kinematic theory of signature verification measurements

John S. Lew

Mathematical Biosciences

Paper

On some properties of contracting matrices

Chai Wah Wu

Linear Algebra and Its Applications

Paper

Neural network based iterative learning control for product qualities in batch processes

Zhihua Xiong, Yixin Xu, et al.

International Journal of Modelling, Identification and Control

View all publications

Abstract

Related

Hadamard Transforms on Multiply/Add Architectures

Kinematic theory of signature verification measurements

On some properties of contracting matrices

Neural network based iterative learning control for product qualities in batch processes