Data Compression


Criteria

Survey Formats

Basics

Compression Methods

Data Formats


Arithmetic Coding (AC)

Principle of the AC

General Algorithm

AC versus Huffman

Data with high Redundancy

Adaptive AC

Implementations


Glossary

Index


Download


www.BinaryEssence.com

Data with high Redundancy


Arithmetic coding offers special aspects, if the data intended for compression contain a particular high redundancy. An extreme example may be a file, which covers 10,000 byte and contains only the value zero (0h).


Since it is sufficient with arithmetic coding to store an arbitrary value from the resulting interval, this might be the value 0 coded by a single byte. Together with the identification of the original file size, the encoded data would require only 3 byte.


Unlike this the Huffman coding could achieve only a reduction to 1,250 byte (10,000 times 1 bit), if one regards only the coding of individual symbols.


 <   ^   > 

Arithmetic Coding Comparison Arithmetic Coding versus Huffman Adaptive Arithmetic Coding