DocumentCode
3146004
Title
An extremely fast Ziv-Lempel data compression algorithm
Author
Williams, Ross N.
Author_Institution
Renaissance Software, Adelaide, SA, Australia
fYear
1991
fDate
8-11 Apr 1991
Firstpage
362
Lastpage
371
Abstract
A new, simple, extremely fast, locally adaptive data compression algorithm of the LZ77 class is presented. The algorithm, called LZRW1, almost halves the size of text files, uses 16 K of memory, and requires about 13 machine instructions to compress and about 4 instructions to decompress each byte. This results in speeds of about 77 K and 250 K bytes per second on a one-MIPS machine. The algorithm runs in linear time and has a good worst-case running time. It adapts quickly and has a negligible initialization overhead, making it fast and efficient for small as well as large blocks of data
Keywords
data compression; LZ77; Ziv-Lempel data compression algorithm; initialization overhead; locally adaptive data compression algorithm; machine instructions; memory; running time; speeds; text files; Australia; Clustering algorithms; Compression algorithms; Data compression; Dictionaries; History; Partitioning algorithms; Real time systems; Software algorithms; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1991. DCC '91.
Conference_Location
Snowbird, UT
Print_ISBN
0-8186-9202-2
Type
conf
DOI
10.1109/DCC.1991.213344
Filename
213344
Link To Document