By Topic

Bit-wise arithmetic coding for data compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kiely, A.B. ; Jet Propulsion Lab., Pasadena, CA, USA

Consider the problem of compressing a uniformly quantized IID source. A traditional approach is to assign variable length codewords to the quantizer output symbols or groups of symbols (e.g., Huffman coding). We propose an alternative solution: assign a fixed length binary codeword to each output symbol in such a way that a zero is more likely than a one in every codeword bit position. This redundancy is then exploited using a block-adaptive binary arithmetic encoder to compress the data. This technique is simple, has low overhead, and can be used as a progressive transmission system

Published in:

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Date of Conference:

17-22 Sep 1995