Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

DCC

2006

IEEE

2006

IEEE

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. 1 Background Arithmetic coding (AC) is a technique for data compression that theoretically allows us to code data at Shannon entropy. The idea was first developed by Pasco[1], who was inspired by a proof of Shannon's theorem, and shortly after by Rissanen [2]. The first p...

Added |
25 Dec 2009 |

Updated |
25 Dec 2009 |

Type |
Conference |

Year |
2006 |

Where |
DCC |

Authors |
Benjamin Kelly, David F. Brailsford |

Comments (0)