A locally adaptive data compression strategy for Chinese English characters

被引:1
作者
Chang, CC
Wang, CH
机构
[1] Inst. of Comp. Sci. and Info. Eng., National Chung Cheng University, Chiayi
关键词
D O I
10.1016/0164-1212(95)00200-6
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A locally adaptive data compression strategy can be efficiently applied to a text data file when characters are used frequently over short intervals. Some data files, such as program files, image files, or exposition files of application software contain some commonly used sequences of characters which occur consecutively. We can use their common characteristics to develop a simple heuristic method of compression. Among all kinds of compression schemes based upon a locally adaptive data compression strategy, the MTF (Move-To-Front) method is a superior one that can be easily implemented and can obtain a higher compression rate for most data files. This article uses the idea of a locally adaptive compression strategy and proposes a new data compression mechanism for Chinese and English data files. Some experimental results show that our proposed method can achieve a higher compression rate than using multigroup Huffman encoding, which is method recently proposed by Chang and Tsai for Chinese data files. (C) 1997 by Elsevier Science inc.
引用
收藏
页码:167 / 179
页数:13
相关论文
共 6 条
[1]   A LOCALLY ADAPTIVE DATA-COMPRESSION SCHEME [J].
BENTLEY, JL ;
SLEATOR, DD ;
TARJAN, RE ;
WEI, VK .
COMMUNICATIONS OF THE ACM, 1986, 29 (04) :320-330
[2]  
CHANG CC, 1991, COMPUTER PROCESSING, V5, P154
[3]   A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].
HUFFMAN, DA .
PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101
[4]  
RYABKO BY, 1987, COMMUN ACM, V30, P792
[5]  
WELCH TA, 1984, COMPUTER, V17, P8, DOI 10.1109/MC.1984.1659158
[6]   UNIVERSAL ALGORITHM FOR SEQUENTIAL DATA COMPRESSION [J].
ZIV, J ;
LEMPEL, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) :337-343