LZW Algorithm Research and Amelioration Based on Pointer Trace

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Dongye Sun, Wen-Pei Sung and Ran Chen

Pages:

4498-4502

DOI:

10.4028/www.scientific.net/AMM.121-126.4498

Citation:

F. Y. Zhang et al., "LZW Algorithm Research and Amelioration Based on Pointer Trace", Applied Mechanics and Materials, Vols. 121-126, pp. 4498-4502, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.