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

Compression for data archiving and backup revisited

Corneliu Constantinescu

SPIE Optical Engineering + Applications 2009

Paper

A Direct Method for Solving Linear Systems

M. Tismenetsky

International Journal of Computer Mathematics

Paper

A minimal descriptor of an ancestral recombinations graph

Laxmi Parida, Pier F. Palamara, et al.

BMC Bioinformatics

Workshop paper

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Fernando Martinez, Juntao Chen, et al.

AAAI 2025

View all publications

Abstract

Related

Compression for data archiving and backup revisited

A Direct Method for Solving Linear Systems

A minimal descriptor of an ancestral recombinations graph

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics