DocumentCode :
2865770
Title :
An evaluation of the Lempel-Ziv-Welch data compression algorithm
Author :
Kotze, H.C. ; Kuhn, G.J.
Author_Institution :
Dept. of Electron. & Comput. Eng., Pretoria Univ., South Africa
fYear :
1989
fDate :
32682
Firstpage :
65
Lastpage :
69
Abstract :
The Lempel-Ziv-Welch (LZW) data compression algorithm is evaluated for use in the removal of the redundancy in computer files. The Ziv-Lempel algorithm and related algorithms are compared with respect to encoding and decoding speed, memory requirements, and compression ratio. Although the LZW algorithm is optimized for hardware implementation, the possibility of implementing it in software is considered. The most important parameter, the compression ratio, was found to be similar to or better than that of other Ziv-Lempel compression techniques, whereas coding speed and memory requirements depended on the programming techniques used
Keywords :
data compression; decoding; encoding; fault tolerant computing; file organisation; Lempel-Ziv-Welch data compression algorithm; compression ratio; computer files; decoding speed; encoding speed; memory requirements; redundancy removal; Compression algorithms; Data compression; Data engineering; Decoding; Encoding; Frequency; Hardware; Huffman coding; Natural languages; Probability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Signal Processing, 1989. COMSIG 1989. Proceedings., Southern African Conference on
Conference_Location :
Stellenbosch
Print_ISBN :
0-87942-713-2
Type :
conf
DOI :
10.1109/COMSIG.1989.129018
Filename :
129018
Link To Document :
بازگشت