WORD-BASED DYNAMIC ALGORITHMS FOR DATA-COMPRESSION

被引:10
作者
JIANG, J
JONES, S
机构
[1] Univ of Technology, Loughborough
来源
IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION | 1992年 / 139卷 / 06期
关键词
DATA COMPRESSION; SOURCE CODING; ALGORITHM DESIGN;
D O I
10.1049/ip-i-2.1992.0078
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A new algorithm, word-based dynamic Lempel-Ziv (WDLZW) for universal (lossless) data compression, is introduced. The novel feature is that the algorithm is optimised for the compression of natural language data, in which all the spaces between words are deleted whenever copy codes or literal codes are sent out. Therefore better compression rates can be achieved. The algorithm can still compress alternative forms of data. The structure, operation and implementation of the WDLZW is described. A comparison with other algorithms when compressing a wide range of data forms is reported. For text-based information WDLZW offers attractive performance. For other forms of data, WDLZW provides compression rates similar to those of dynamic Lempel Ziv systems.
引用
收藏
页码:582 / 586
页数:5
相关论文
共 6 条
[1]  
Bell T.C., 1990, TEXT COMPRESSION
[2]   DATA-COMPRESSION WITH FINITE WINDOWS [J].
FIALA, ER ;
GREENE, DH .
COMMUNICATIONS OF THE ACM, 1989, 32 (04) :490-505
[3]  
JIANG J, 1991, 3RD IEE BANG COMM S
[4]  
WELCH TA, 1984, COMPUTER, V17, P8, DOI 10.1109/MC.1984.1659158
[5]  
Weste N.H.E., 1988, PRINCIPLES CMOS VLSI
[6]   UNIVERSAL ALGORITHM FOR SEQUENTIAL DATA COMPRESSION [J].
ZIV, J ;
LEMPEL, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) :337-343