For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Arithmetic Coding for Countable Alphabet Sources with Finite Precision
Mikihiko NISHIARA Hiroyoshi MORITA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/10/01
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Theory
arithmetic coding, countable alphabet, finite precision of calculation, implementation of coding algorithm,
Full Text: PDF(405.2KB)>>
An improved arithmetic coding which provides an encoder with finite calculation precision for source sequences over a countable alphabet is presented. Conventional arithmetic coding theoretically has infinite precision for real variables. However any algorithm implemented on a computer has finite precision. This implies that conventional arithmetic codes can only encode sequences over a finite alphabet. The improved arithmetic coding presented here has a computational complexity which is roughly proportional to the length of the source sequence for a given source.