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

Joint spectral radius and path-complete graph Lyapunov functions

Amir Ali Ahmadi, Raphaël M. Jungers, et al.

SICON

Conference paper

Wavefront and caustic surfaces of refractive laser beam shaper

David L. Shealy, John A. Hoffnagle

SPIE Optical Engineering + Applications 2007

Conference paper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004

Conference paper

Compression for data archiving and backup revisited

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009

View all publications

Abstract

Related

Joint spectral radius and path-complete graph Lyapunov functions

Wavefront and caustic surfaces of refractive laser beam shaper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Compression for data archiving and backup revisited