Introduction to Arithmetic Coding -- Theory and Practice

Abstract

This introduction to arithmetic coding is divided in two parts. The first explains how and why arithmetic coding works. We start presenting it in very general terms, so that its simplicity is not lost under layers of implementation details. Next, we show some of its basic properties, which are later used in the computational techniques required for a practical implementation. In the second part, we cover the practical implementation aspects, including arithmetic operations with low precision, the subdivision of coding and modeling, and the realization of adaptive encoders. We also analyze the arithmetic coding computational complexity, and techniques to reduce it.

Hewlett-Packard Laboratories Report; Chapter in Lossless Compression Handbook (ed. K. Sayood), Academic Press

Cited by in corpus (4)

• Learning Content-Weighted Deep Image Compression
• A memory versus compression ratio trade-off in PPM via compressed context modeling
• Compression of next-generation sequencing reads aided by highly efficient de novo assembly
• Enumerative Data Compression with Non-Uniquely Decodable Codes