Title :
On-line adaptive canonical prefix coding with bounded compression loss
Author :
Turpin, Andrew ; Moffat, Alistair
Author_Institution :
Dept. of Comput. Sci. & Software Eng., Melbourne Univ., Parkville, Vic., Australia
fDate :
1/1/2001 12:00:00 AM
Abstract :
Semistatic minimum-redundancy prefix (MRP) coding is fast compared with rival coding methods, but requires two passes during encoding. Its adaptive counterpart, dynamic Huffman coding, requires only one pass over the input message for encoding and decoding, and is asymptotically efficient. Dynamic Huffman (1952) coding is, however, notoriously slow in practice. By removing the restriction that the code used for each message symbol must have minimum-redundancy and thereby admitting some compression loss, it is possible to improve the speed of adaptive MRP coding. This paper presents a controlled method for trading compression loss for coding speed by approximating symbol frequencies with a geometric distribution. The result is an adaptive MRP coder that is asymptotically efficient and also fast in practice
Keywords :
Huffman codes; adaptive codes; data compression; decoding; adaptive MRP coder; asymptotically efficient coder; asymptotically efficient coding; bounded compression loss; coding methods; coding speed; decoding; dynamic Huffman coding; encoding; fast coder; geometric distribution; input message; message symbol; online adaptive canonical prefix coding; semistatic minimum-redundancy prefix coding; symbol frequencies approximation; Computer science; Context modeling; Decoding; Encoding; Frequency estimation; Huffman coding; Materials requirements planning; Predictive models; Probability; Software engineering;
Journal_Title :
Information Theory, IEEE Transactions on
