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

Single-shot General Hyper-parameter Optimization for Federated Learning

Yi Zhou, Parikshit Ram, et al.

ICLR 2023

Conference paper

True 3-D displays for avionics and mission crewstations

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

SPIE AeroSense 1997

Paper

Advanced lithography kits: Serifs and hammerhead

Hang-Yip Liu, Steffen Schulze, et al.

Proceedings of SPIE - The International Society for Optical Engineering

Conference paper

QoS support for media broadcast in a services oriented architecture

D.S. Turaga, K. Ratakonda, et al.

SCC 2006

View all publications

Abstract

Related

Single-shot General Hyper-parameter Optimization for Federated Learning

True 3-D displays for avionics and mission crewstations

Advanced lithography kits: Serifs and hammerhead

QoS support for media broadcast in a services oriented architecture