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

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

Conference paper

Compression scheme for digital cinema application

Ligang Lu, Jack L. Kouloheris

IS&T/SPIE Electronic Imaging 2002

Conference paper

Single-shot General Hyper-parameter Optimization for Federated Learning

Yi Zhou, Parikshit Ram, et al.

ICLR 2023

Conference paper

Learning Reduced Order Dynamics via Geometric Representations

Imran Nasim, Melanie Weber

SCML 2024

View all publications

Abstract

Related

On the spectral radius of (0,1)-matrices

Compression scheme for digital cinema application

Single-shot General Hyper-parameter Optimization for Federated Learning

Learning Reduced Order Dynamics via Geometric Representations