Worst-case error analysis of lifting-based fast DCT-algorithms

DOI10.1109/TSP.2005.851114MaRDI QIDQ5356673zbMATH OpenFDO

Authors Miriam Primbs

Publication date 20 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2005.851114

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Recommendations

• Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
• A Deterministic Low-Complexity Approximate (Multiplier-Less) Technique for DCT Computation
• scientific article; zbMATH DE number 733445
• Integer DCTs and fast algorithms
• Low-Complexity Scaling Methodsfor DCT-II Approximations
• Fast DCT-I, DCT-III, and DCT-IV via moments
• A fast algorithm for computing multidimensional dct on certain small sizes
• scientific article; zbMATH DE number 5038973
• On the regular structure for the fast 2-D DCT algorithm

Cited in

(2)

• Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
• New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks

This page was built for publication: Worst-case error analysis of lifting-based fast DCT-algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5356673)