A fast renormalisation for arithmetic coding
Schindler, M.
Billrothstrasse, Vienna;
This paper appears in: Data Compression Conference, 1998. DCC '98. Proceedings
Publication Date: 30 Mar-1 Apr 1998
On page(s): 572-
Meeting Date: 03/30/1998 - 04/01/1998
Location: Snowbird, UT, USA
ISSN: 1068-0314
ISBN: 0-8186-8406-2
References Cited: 0
INSPEC Accession Number: 6004890
Digital Object Identifier: 10.1109/DCC.1998.672314
Current Version Published: 2002-08-06
Abstract
Summary form only given. All integer based arithmetic coding
consists of two steps: proportional range restriction and range
expansion (renormalisation). Here a method is presented that
significantly reduces the complexity of renormalisation, allowing a
speedup of arithmetic coding by a factor of up to 2. The main idea is to
treat the output not as a binary number, but as a base 256 (or other)
number. This requires less renormalisation and no bitwise operations
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
