On the Multiplicative Complexity of Discrete Cosine Transforms

Ephraim Feig; Shmuel Winograd

doi:10.1109/18.144722

IEEE Trans. Inf. Theory

Paper

01 Jan 1992

On the Multiplicative Complexity of Discrete Cosine Transforms

View publication

Abstract

The multiplicative complexity of discrete cosine transforms (DCT’s) of arbitrary dimensions on inputs sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCT’s on input sizes, which are powers of two, are also obtained. © 1992 IEEE

Conference paper