LZW Algorithm Research and Amelioration Based on Pointer Trace

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4498-4502

Citation:

Online since:

October 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Quan Wang, Chun Qi, Xinmin Luo and Song Liang: Modified LZW algorithm and its parameters optimization. Journal of Chongqing University of Posts and Telecommunications Vol. 17 (2005), pp.351-5.

Google Scholar

[2] Zhigang Wang, Chuanwen Chang and Wenshen Mao: LZW Algorithm Optimizing and the Application in Radaa Data Compression. Computer&Digital Engineering Vol. 37 (2009), pp.32-4.

Google Scholar

[3] Weimin Jin: Application Research of the LZW Algorithm in Data Communications. COMPUTER ENGINEERING & SCIENCE Vol. 26 (2004), pp.46-8.

Google Scholar

[4] Fenglin Zhang and Sifeng Lin: An Improved LZW Data Compression Algorithm. MINI-MICRO SYSTEMS Vol. 27 (2006), pp.1897-9.

Google Scholar

[5] Xia Xu, Guangsi Ma and Tao Yu: Research and Improvement on LZW Lossless Compression Algorithm. COMPUTER TECHNOLOGY AND DEVELOPMENT Vol 19(2009), pp.125-7.

Google Scholar