On algebras related to the discrete cosine transform

DOI10.1016/S0024-3795(96)00634-9zbMath0888.65145WikidataQ126590404 ScholiaQ126590404MaRDI QIDQ1372961

Michael Ben-Or, Ephraim Feig

Publication date: 4 June 1998

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

zbMATH Keywords

Chebyshev polynomials; discrete Fourier transform; discrete cosine transform; Chinese-Remainder Theorem

Mathematics Subject Classification ID

65T50: Numerical methods for discrete and fast Fourier transforms

Related Items

Supercharacters and the discrete Fourier, cosine, and sine transforms, Lateral Movement in Undergraduate Research: Case Studies in Number Theory

Cites Work

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