Finite-precision arithmetic coding via index-splitting and probability-fitting

This paper proposes a fitting-by-splitting algorithm (abbreviated as the FS algorithm), which is composed of an index-splitting (IS) algorithm and a probability-fitting (PF) algorithm, to effectively achieve the finite-precision arithmetic coding code named as the FS-AC code. The FS algorithm genera...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 167; no. 2; pp. 976 - 995
Main Authors: Chan, Din-Yuen, Ku, Cheng-Yuan
Format: Journal Article
Language:English
Published: New York, NY Elsevier Inc 15.08.2005
Elsevier
Subjects:
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Arithmetic coding
Binary arithmetic coding
Coding, codes
Computer science; control theory; systems
Exact sciences and technology
Index-splitting
Information, signal and communications theory
Mathematics
Number theory
Sciences and techniques of general use
Signal and communications theory
Telecommunications and information theory
Theoretical computing
Arithmetic coding
Binary arithmetic coding
Index-splitting
Block code
Error estimation
Applied mathematics
Index splitting
High precision
Probability distribution
Binary coding
ISSN:0096-3003, 1873-5649
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a fitting-by-splitting algorithm (abbreviated as the FS algorithm), which is composed of an index-splitting (IS) algorithm and a probability-fitting (PF) algorithm, to effectively achieve the finite-precision arithmetic coding code named as the FS-AC code. The FS algorithm generates the FS-AC codes of arbitrarily specified length without the need of post-appended sentinel symbol or pre-affixed side-information bits. Its IS process can split the input symbols into paired indices to make the residual information space be reused as effectively as possible at the end of arithmetically encoding a fixed-precision code. And, the PF process performs after each IS operation for enhancing the reuse efficiency via a fast adaptation process of probability table. Through the integration of IS and PF processes, not only the coding efficiency of proposed finite-precision AC codec can be close to that of unlimited precision AC codec especially for our proposed binary AC codecs. And also, consecutive FS-AC codes can be mutually independent such that the error propagation can be almost blocked to an AC code in problem. Hence, our new AC codecs can be appropriate for generating finite-precision AC codes in the high-speed networks.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2004.06.123