An Introduction to Arithmetic Coding

Abstract

An Introduction to Arithmetic Coding Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per iteration or recursion. On each recursion, the algorithm successively partitions an interval of the number line between 0 and I , and retains one of the partitions as the new interval. Thus, the algorithm successively deals with smaller intervals, and the code string, viewed as a magnitude, lies in each of the nested intervals. The data string is recovered by using magnitude comparisons on the code string to recreate how the encoder must have successively partitioned and retained each nested subinterval. Arithmetic coding differs considerably from the more familiar compression coding techniques, such as prefix (Huffman) codes. Also, it should not be confused with error control coding, whose object is to detect and correct errors in computer operations. This paper presents the key notions of arithmetic compression coding by means of simple examples.

Arithmetic coding for finite-state noiseless channels

“…In all of the implementation schemes described in Langdon (1984), the binary output corresponding to y(m)…”

“…Rissanen and Langdon (1979) described other arithmetic codes and derived a duality result between first-in, first-out codes and last-in, first-out codes. The modifications that were introduced in these papers to account for the precision problem and make arithmetic coding a more practical encoding scheme are complex and elusive to explain in an easy way; we refer the reader to Langdon (1984) for some perspective on these modifications. Jones (1984) and Witten et.…”

Block-oriented compression techniques for large statistical databases

“…These frequencies allow different code words to be assigned to different source words. The data stream is usually coded using arithmetic coding [13], using these frequencies. As arithmetic coding has been shown to be optimal with 1.…”

“…respect to a given set of frequencies [13], most statistical techniques strive to produce as accurate a statistical model of the source data stream as possible.…”

Discovering patterns in Plasmodium falciparum genomic DNA

“…a code that is decodable without hidden knowledge, is a valid upper bound on the complexity of a sequence, and there are many practical techniques for forming very good codes. It should also be mentioned that the technique of arithmetic coding [6] can in effect allocate a code word of non-integer length to an event, E, so it is not necessary to round − log 2 (p(E)) up. In most of the more complicated models and codes, the probabilities of the characters, (e.g.…”