DocumentCode :
1553175
Title :
A probability-ratio approach to approximate binary arithmetic coding
Author :
Huynh, Linh ; Moffat, Alistair
Author_Institution :
Dept. of Comput. Sci., RMIT, Melbourn, Vic., Australia
Volume :
43
Issue :
5
fYear :
1997
fDate :
9/1/1997 12:00:00 AM
Firstpage :
1658
Lastpage :
1662
Abstract :
We describe an alternative mechanism for approximate binary arithmetic coding. The quantity that is approximated is the ratio between the probabilities of the two symbols. Analysis is given to show that the inefficiency so introduced is less than 0.7% on average; and in practice the compression loss is negligible
Keywords :
approximation theory; arithmetic codes; data compression; probability; approximate binary arithmetic coding; compression loss; inefficiency; probability-ratio approach; symbols; Arithmetic; Computer errors; Computer science; Data compression; Decoding; Error correction codes; Image coding; Information theory; Linear code; NP-hard problem;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.623170
Filename :
623170
Link To Document :
بازگشت