The B-coder: an improved binary arithmetic coder and probability estimator
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-...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2006
|
| Online Access: | https://eprints.nottingham.ac.uk/28463/ |
| _version_ | 1848793577629417472 |
|---|---|
| author | Kelly, Benjamin G. Brailsford, David F. |
| author_facet | Kelly, Benjamin G. Brailsford, David F. |
| author_sort | Kelly, Benjamin G. |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:02:31Z |
| format | Conference or Workshop Item |
| id | nottingham-28463 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:02:31Z |
| publishDate | 2006 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-284632020-05-04T16:26:20Z https://eprints.nottingham.ac.uk/28463/ The B-coder: an improved binary arithmetic coder and probability estimator Kelly, Benjamin G. Brailsford, David F. 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. 2006-03-28 Conference or Workshop Item NonPeerReviewed Kelly, Benjamin G. and Brailsford, David F. (2006) The B-coder: an improved binary arithmetic coder and probability estimator. In: Data Compression Conference 2006 (DCC 2006), 28-30 March 2006, Snowbird, Utah. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1607299 |
| spellingShingle | Kelly, Benjamin G. Brailsford, David F. The B-coder: an improved binary arithmetic coder and probability estimator |
| title | The B-coder: an improved binary arithmetic coder and
probability estimator |
| title_full | The B-coder: an improved binary arithmetic coder and
probability estimator |
| title_fullStr | The B-coder: an improved binary arithmetic coder and
probability estimator |
| title_full_unstemmed | The B-coder: an improved binary arithmetic coder and
probability estimator |
| title_short | The B-coder: an improved binary arithmetic coder and
probability estimator |
| title_sort | b-coder: an improved binary arithmetic coder and
probability estimator |
| url | https://eprints.nottingham.ac.uk/28463/ https://eprints.nottingham.ac.uk/28463/ |