Title :
A fast renormalisation for arithmetic coding
Author :
Schindler, Michael
Author_Institution :
Billrothstrasse, Vienna, Austria
fDate :
30 Mar-1 Apr 1998
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
Keywords :
arithmetic codes; renormalisation; arithmetic coding; base 256 number; complexity reduction; fast renormalisation; integer based arithmetic coding; proportional range restriction; range expansion; Arithmetic; Counting circuits; Decoding; Encoding; Linux;
Conference_Titel :
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-8406-2
DOI :
10.1109/DCC.1998.672314
