Benjamin G. Kelly email@example.com
The B-coder: an improved binary arithmetic coder and probability estimator
Kelly, Benjamin G.; Brailsford, David F.
David F. Brailsford firstname.lastname@example.org
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate’ arithmetic coder, because of its use of an approximation to multiplication. We show that the approximation used in the B-coder has an efficiency cost of 0.003 compared to Shannon entropy. At the heart of the B-coder is an efficient state machine that adapts rapidly to the data to be coded. The adaptation is achieved by allowing a fixed table of transitions and probabilities to change within a given tolerance. The combination of the two techniques gives a coder that out-performs the current state-of-the-art binary arithmetic coders.
Kelly, B. G., & Brailsford, D. F. (2006). The B-coder: an improved binary arithmetic coder and probability estimator
|Conference Name||Data Compression Conference 2006 (DCC 2006)|
|End Date||Mar 30, 2006|
|Publication Date||Mar 28, 2006|
|Deposit Date||Mar 16, 2015|
|Publicly Available Date||Mar 16, 2015|
|Peer Reviewed||Not Peer Reviewed|
|Copyright Statement||Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf|
|Additional Information||Poster derived from paper published in: Proceedings of the Data Compression Conference (DCC’06). IEEE Computer Society, 2006, ISBN: 0-7695-2545-8, pp. 456, doi: 10.1109/DCC.2006.76|
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf