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

Dynamic Graph Convolutional Networks Using the Tensor M-Product

Conference paper

Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networks

Conference paper

Understanding Benign Overfitting in Gradient-based Meta Learning

Workshop paper

Knowledge-augmented Risk Assessment (KaRA): a hybrid-intelligence framework for supporting knowledge-intensive risk assessment of prospect candidate

View all publications

Abstract

Related

Dynamic Graph Convolutional Networks Using the Tensor M-Product

Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networks

Understanding Benign Overfitting in Gradient-based Meta Learning

Knowledge-augmented Risk Assessment (KaRA): a hybrid-intelligence framework for supporting knowledge-intensive risk assessment of prospect candidate