Fast and numerically stable algorithms for discrete cosine transforms

2004/09/24 by Gerlind Plonka, Manfred Tasche · 3 citations
Computer Science · Mathematics · #Advanced Data Compression Techniques #Algorithm #Arithmetic #Computer science #Digital Filter Design and Implementation #Discrete cosine transform #Geometry #Mathematics #Modified discrete cosine transform #Numerical Methods and Algorithms #Simple (philosophy) #Transform coding #Trigonometric functions

paper · doi:10.1016/j.laa.2004.07.015

openalex publication_date 2004/09/24 · crossref created 2004/09/24 · crossref issued 2005/01/01 · crossref published 2005/01/01 · crossref published-print 2005/01/01 · crossref deposited 2019/02/03 · openalex created_date 2025/10/10 · crossref indexed 2026/04/20 · openalex updated_date 2026/06/21

Citations

• Gauss and the history of the fast fourier transform
• The Discrete Cosine Transform
• Discrete Cosine Transform
• Gauss and the history of the fast Fourier transform
• Fast algorithms for the discrete cosine transform
• A Fast Computational Algorithm for the Discrete Cosine Transform

Cited by

• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• Discrete cosine transform [wikipedia]