Share Email Print

Proceedings Paper

Arithmetic coding with constrained carry operations
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Buffer or counter-based techniques are adequate for dealing with carry propagation in software implementations of arithmetic coding, but create problems in hardware implementations due to the difficulty of handling worst-case scenarios, defined by very long propagations. We propose a new technique for constraining the carry propagation, similar to “bit-stuffing,” but designed for encoders that generate data as bytes instead of individual bits, and is based on the fact that the encoder and decoder can maintain the same state, and both can identify the situations when it desired to limit carry propagation. The new technique adjusts the coding interval in a way that corresponds to coding an unused data symbol, but selected to minimize overhead. Our experimental results demonstrate that the loss in compression can be made very small using regular precision for arithmetic operations.

Paper Details

Date Published: 4 March 2015
PDF: 7 pages
Proc. SPIE 9410, Visual Information Processing and Communication VI, 94100B (4 March 2015); doi: 10.1117/12.2175901
Show Author Affiliations
Abo-Talib Mahfoodh, Michigan State Univ. (United States)
Amir Said, LG Electronics Inc. (United States)
Sehoon Yea, LG Electronics Inc. (United States)

Published in SPIE Proceedings Vol. 9410:
Visual Information Processing and Communication VI
Amir Said; Onur G. Guleryuz; Robert L. Stevenson, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?