Fast algorithms for the discrete cosine transformation

zbMATH Open0795.65100MaRDI QIDQ1309087

M. N. Yatsimirskij

Publication date: 13 March 1994

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

fast algorithmsbutterfly operationscosecant multiplerscosine multipliersinverse discrete cosine transform

Mathematics Subject Classification ID

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

Related Items (5)

Fast odd discrete cosine transform algorithms ⋮ The Arithmetic Cosine Transform: Exact and Approximate Algorithms ⋮ A new two-dimensional fast cosine transform algorithm ⋮ A generalized fast algorithm for \(n\)-D discrete cosine transform and its application to motion picture coding ⋮ Fast algorithm for transformation of lattices

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• A fast algorithm for the \(n\)-D discrete cosine transform 👍 👎
• Fast and numerically stable algorithms for discrete cosine transforms 👍 👎
• A fast algorithm for the discrete sine transform implemented by the fast cosine transform 👍 👎
• Fast odd discrete cosine transform algorithms 👍 👎
• Fast algorithms for computing the discrete cosine transform 👍 👎
• Fast algorithms for the discrete cosine transform 👍 👎

This page was built for publication: Fast algorithms for the discrete cosine transformation