Non-Proper Variable-to-Fixed Length Arithmetic Coding

Suk-hee CHO; Ryuji KOHNO; Ji-hwan PARK

Non-Proper Variable-to-Fixed Length Arithmetic Coding

Suk-hee CHO, Ryuji KOHNO, Ji-hwan PARK

Full Text Views

0

Share
Cite this

Summary :

The VF (Variable-to-Fixed length) arithmetic coding method combines the advantage of an ordinary stream arithmetic code with the simplicity of a block code. One of the advantages of VF codes is that the transmission errors or channel errors do not propagate infinitely and are restricted to the block in question. In this paper, we propose a modified type of non-proper VF arithmetic coding method that defines an input alphabet subset according to both the number of codewords in the current codeword set and input symbol probability and that splits the codeword set completely for a newly defined alphabet subset when the codeword set becomes smaller by each splitting. The proposed coding method carrys out independence of each codeword and guarantees that there is no collision while there is a waste of codeword(s) in conventional AB-coding due to collision. We examine the performance of the proposed method and compare it with that of other VF codes in terms of compression ratio and algorithmic complexity.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.8 pp.1739-1747

Publication Date: 1998/08/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Information Theory and Coding Theory

Cite this

Copy

Suk-hee CHO, Ryuji KOHNO, Ji-hwan PARK, "Non-Proper Variable-to-Fixed Length Arithmetic Coding" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 8, pp. 1739-1747, August 1998, doi: .
Abstract: The VF (Variable-to-Fixed length) arithmetic coding method combines the advantage of an ordinary stream arithmetic code with the simplicity of a block code. One of the advantages of VF codes is that the transmission errors or channel errors do not propagate infinitely and are restricted to the block in question. In this paper, we propose a modified type of non-proper VF arithmetic coding method that defines an input alphabet subset according to both the number of codewords in the current codeword set and input symbol probability and that splits the codeword set completely for a newly defined alphabet subset when the codeword set becomes smaller by each splitting. The proposed coding method carrys out independence of each codeword and guarantees that there is no collision while there is a waste of codeword(s) in conventional AB-coding due to collision. We examine the performance of the proposed method and compare it with that of other VF codes in terms of compression ratio and algorithmic complexity.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e81-a_8_1739/_p

Copy

@ARTICLE{e81-a_8_1739,
author={Suk-hee CHO, Ryuji KOHNO, Ji-hwan PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Non-Proper Variable-to-Fixed Length Arithmetic Coding},
year={1998},
volume={E81-A},
number={8},
pages={1739-1747},
abstract={The VF (Variable-to-Fixed length) arithmetic coding method combines the advantage of an ordinary stream arithmetic code with the simplicity of a block code. One of the advantages of VF codes is that the transmission errors or channel errors do not propagate infinitely and are restricted to the block in question. In this paper, we propose a modified type of non-proper VF arithmetic coding method that defines an input alphabet subset according to both the number of codewords in the current codeword set and input symbol probability and that splits the codeword set completely for a newly defined alphabet subset when the codeword set becomes smaller by each splitting. The proposed coding method carrys out independence of each codeword and guarantees that there is no collision while there is a waste of codeword(s) in conventional AB-coding due to collision. We examine the performance of the proposed method and compare it with that of other VF codes in terms of compression ratio and algorithmic complexity.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - Non-Proper Variable-to-Fixed Length Arithmetic Coding
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1739
EP - 1747
AU - Suk-hee CHO
AU - Ryuji KOHNO
AU - Ji-hwan PARK
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 1998
AB - The VF (Variable-to-Fixed length) arithmetic coding method combines the advantage of an ordinary stream arithmetic code with the simplicity of a block code. One of the advantages of VF codes is that the transmission errors or channel errors do not propagate infinitely and are restricted to the block in question. In this paper, we propose a modified type of non-proper VF arithmetic coding method that defines an input alphabet subset according to both the number of codewords in the current codeword set and input symbol probability and that splits the codeword set completely for a newly defined alphabet subset when the codeword set becomes smaller by each splitting. The proposed coding method carrys out independence of each codeword and guarantees that there is no collision while there is a waste of codeword(s) in conventional AB-coding due to collision. We examine the performance of the proposed method and compare it with that of other VF codes in terms of compression ratio and algorithmic complexity.
ER -