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

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A.R. Conn, Nick Gould, et al.

Mathematics of Computation

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Frank R. Libsch, Takatoshi Tsujimura

Active Matrix Liquid Crystal Displays Technology and Applications 1997

Paper

Soft decoding of several classes of array codes

Mario Blaum, John L. Fan, et al.

IEEE International Symposium on Information Theory - Proceedings

View all publications

Abstract

Related

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A generic grouping algorithm and its quantitative analysis

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Soft decoding of several classes of array codes