LZW Algorithm Research and Amelioration Based on Pointer Trace

摘要：

　　LZW (Lempel Ziv Welch) algorithm is a dictionary compression algorithm with excellent performance.The algorithm,which has important advantages including strong universal ability and a dynamically formed dictionary in coding and decoding,is used extensively in lossless data compression field.This paper implements an LZW algorithm based on a tree-like data structure in C and offers two optimization schemes,including using pointer-trace and Variable-length code.The results show that these schemes extremely improve the compression efficiency with reduced compression time cost and provide an effective guarantee for real time transmission.

关键词： LZW A tree-like data structure pointer-trace Variable-length code Compression time Compression efficiency

作者: Fengyuan Zhang Lili Wen Xiaolu Jia Zhao Li Mengli Chen Cheng Chen

作者单位: Beijing University of Chemical Technology, Beijing, 100029, China

会议类型: 国际会议

会议名称: the Second International Conference on Frontiers of Manufacturing and Design Science(第二届制造与设计科学国际会议(ICFMD 2011))

会议地点: 台湾

会议语种:英文

页码: 4498-4502

在线出版日期: 2011-12-11（万方平台首次上网日期，不代表论文的发表时间）