Lee Jin Ho, Cho Suk Hee, Park Ji Hwan, Kang Byong Uk

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 5, pp. 677-690, Sep. 1995
10.3745/KIPSTE.1995.2.5.677,   PDF Download:

Abstract

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring which is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation of symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

Statistics
Cite this article