Title :
New techniques in context modeling and arithmetic encoding
Author_Institution :
Texas Univ., Austin, TX, USA
Abstract :
The PPM algorithm is known to be one of the most powerful data compression techniques. However, it uses a large amount of memory, and operates slowly. Several new techniques were explored which address the problems with PPM, at each order of context modeling: the DefSum (or deferred summation) order-0 coder, the ListLRU order-1 coder, the static Huffman order-1 coder, and the PPMCB high-order coder
Keywords :
Huffman codes; arithmetic codes; context-sensitive grammars; data compression; prediction theory; DefSum order-0 coder; ListLRU order-1 coder; PPM algorithm; PPMCB high-order coder; arithmetic encoding; context modeling; data compression techniques; deferred summation; memory; static Huffman order-1 coder; Arithmetic; Character generation; Context modeling; Data compression; Encoding; Huffman coding; Predictive models; Probability; Statistics; Web sites;
Conference_Titel :
Data Compression Conference, 1996. DCC '96. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-7358-3
DOI :
10.1109/DCC.1996.488354
