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.

Conference paper

True 3-D displays for avionics and mission crewstations

Elizabeth A. Sholler, Frederick M. Meyer, et al.

SPIE AeroSense 1997

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

Conference paper

Byzantine-Robust Decentralized Federated Learning

Minghong Fang, Zifan Zhang, et al.

CCS 2024

Paper

A remark on an algorithm for best L^p approximation

Charles Micchelli

Journal of Approximation Theory

View all publications

Abstract

Related

True 3-D displays for avionics and mission crewstations

Bounds on the ergodic capacity of training-based multiple-antenna systems

Byzantine-Robust Decentralized Federated Learning

A remark on an algorithm for best Lp approximation

A remark on an algorithm for best L^p approximation