Abstract
Arithmetic coding has become an important and efficient lossless compression technique for image coding. Multiplication free arithmetic coding algorithms provide excellent tradeoff between operation complexity and coding performance. This paper presents a whole family of multiplication free arithmetic codes which achieve the best coding efficiency and can be used for arbitrary size alphabets. This is accomplished by studying the effects of truncation and rounding in the sub-intervals for approximations. The complete tradeoff between the complexity of operations and compression performance of all the algorithms is presented. The conclusive study show that there will be no more practical multiplication free arithmetic codes.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 437-440 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 1 |
| State | Published - Jan 1 1995 |
| Event | Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA Duration: Apr 30 1995 → May 3 1995 |