On algebras related to the discrete cosine transform

DOI10.1016/S0024-3795(96)00634-9MaRDI QIDQ1372961zbMATH OpenWikidataFDO

Authors Ephraim Feig, Michael Ben-Or

Publication date 4 June 1998

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(96)00634-9

zbMATH Keywords

Chebyshev polynomialsChinese-Remainder Theoremdiscrete cosine transformdiscrete Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Review text

The authors present an algebraic theory for the discrete cosine transform (modified DCT-II) which is analogous to the well-known theory of the discrete Fourier transform (DFT). To design fast DCT-algorithms we have to replace \(\mathbf C[x]/(x^n- 1)\) (DFT-setting) by \(\mathbf R[x]/(x- 1)U_N(x)\) and to use the Chinese-Remainder Theorem similar to the DFT-case. See also \textit{G. Steidl} and \textit{M. Tasche} [Math. Comput. 56, No. 193, 281-296 (1991; Zbl 0725.65145)].

Recommendations

• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• Fast algorithms for the discrete cosine transform
• scientific article; zbMATH DE number 24367

Cites work

• A Fast Computational Algorithm for the Discrete Cosine Transform
• A fast cosine transform in one and two dimensions
• A new algorithm to compute the discrete cosine Transform
• A Sinusoidal Family of Unitary Transforms
• Abelian semi-simple algebras and algorithms for the discrete Fourier transform
• Discrete Cosine Transform
• Fast discrete transforms by means of eigenpolynomials
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• Multi-iterative methods
• On Computing the Discrete Cosine Transform
• On Computing the Discrete Fourier Transform
• On the Computation of the Discrete Cosine Transform
• Simple FFT and DCT algorithms with reduced number of operations.
• Some remarks on multivariate Chebyshev polynomials
• Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations
• THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
• The multiplicative complexity of the discrete Fourier transform

Cited in

(6)

• Abelian semi-simple algebras and algorithms for the discrete Fourier transform
• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
• Supercharacters and the discrete Fourier, cosine, and sine transforms
• Lateral movement in undergraduate research: case studies in number theory
• Fast polynomial multiplication and convolutions related to the discrete cosine transform
• Comments on ``Canonical transformations of the discrete cosine transform

This page was built for publication: On algebras related to the discrete cosine transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372961)