Invertible integer DCT algorithms

DOI10.1016/S1063-5203(03)00032-0zbMath1030.65144MaRDI QIDQ1406574

Manfred Tasche, Gerlind Plonka-Hoch

Publication date: 4 September 2003

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

zbMATH Keywords

data compressionnumerical experimentserror estimatediscrete cosine transformworst case errorrounding-offfactorization of cosine matrixinteger DCTinvertible integer DCTlifting matrixloseless coding

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks ⋮ A global method for invertible integer DCT and integer wavelet algorithms ⋮ Extended discrete cosine transform

Uses Software

• binDCT

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring wavelet transforms into lifting steps
• Wavelet transforms that map integers to integers
• The Discrete Cosine Transform
• Integer DCTs and fast algorithms

This page was built for publication: Invertible integer DCT algorithms