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

Understanding latent correlation-based multiview learning and self-supervision: An identifiability perspective

Conference paper

Federated acoustic modeling for automatic speech recognition

Conference paper

Multi-Structural Games and Number of Quantifiers

Paper

Subgaussian Tail Bounds via Stability Arguments

View all publications

Abstract

Related

Understanding latent correlation-based multiview learning and self-supervision: An identifiability perspective

Federated acoustic modeling for automatic speech recognition

Multi-Structural Games and Number of Quantifiers

Subgaussian Tail Bounds via Stability Arguments