Fast and numerically stable algorithms for discrete cosine transforms

DOI10.1016/j.laa.2004.07.015zbMath1072.65171OpenAlexW1996819670WikidataQ55970224 ScholiaQ55970224MaRDI QIDQ1765902

Manfred Tasche, Gerlind Plonka-Hoch

Publication date: 23 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.laa.2004.07.015

zbMATH Keywords

algorithmfast discrete cosine transformnumerical stability, factorization of DCT matrices into sparse matrices

Mathematics Subject Classification ID

Factorization of matrices (15A23) Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (17)

A wavelet OFDM receiver for baseband power line communications ⋮ New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks ⋮ Fast and Stable Algorithms for Discrete Sine Transformations having Orthogonal Factors ⋮ Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms ⋮ Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application ⋮ Fast SGL Fourier transforms for scattered data ⋮ Roundoff error analysis of fast DCT algorithms in fixed point arithmetic ⋮ Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ Numerical stability of biorthogonal wavelet transforms ⋮ Signal flow graph approach to efficient and forward stable DST algorithms ⋮ Improvement of the discrete cosine transform calculation by means of a recursive method ⋮ Sparse fast DCT for vectors with one-block support ⋮ Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors ⋮ Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks ⋮ Real sparse fast DCT for vectors with short support ⋮ Cosine manifestations of the Gelfand transform

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified discrete cosine and discrete sine transform computation
• Gauss and the history of the fast Fourier transform
• Fast radix-\(p\) discrete cosine transform
• Factoring wavelet transforms into lifting steps
• A new algorithm to compute the discrete cosine Transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• On computing the discrete Fourier and cosine transforms
• Fast algorithms for the discrete cosine transform
• A Fast Computational Algorithm for the Discrete Cosine Transform
• The Discrete Cosine Transform
• The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
• Numerical stability of fast cosine transforms
• Discrete Cosine Transform
• A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms

This page was built for publication: Fast and numerically stable algorithms for discrete cosine transforms