On the multiplicative complexity of discrete cosine transforms

DOI10.1109/18.144722zbMath0757.65153OpenAlexW2030480995MaRDI QIDQ4014159

Ephraim Feig, Shmuel Winograd

Publication date: 11 October 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.144722

zbMATH Keywords

discrete cosine transformmultiplicative complexityminimum number of nonrational multiplications

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items

An integer approximation method for discrete sinusoidal transforms ⋮ A generalized approach to linear transform approximations with applications to the discrete cosine transform ⋮ Improvement of the discrete cosine transform calculation by means of a recursive method