Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
237 views

LZW Compression Algorithm

Lempel–Ziv–Welch (LZW) is a lossless data compression algorithm that builds a dictionary of frequently encountered patterns in the input data and encodes them with fixed-length codes. It works by finding the longest match between the current input and strings in the dictionary, outputting the code for that string, and adding the new string to the dictionary. LZW compression became widely used and was able to compress English text files to around half their original size on average, though it has been replaced by newer algorithms like DEFLATE that provide better compression ratios.

Uploaded by

Vlad Pașca
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
237 views

LZW Compression Algorithm

Lempel–Ziv–Welch (LZW) is a lossless data compression algorithm that builds a dictionary of frequently encountered patterns in the input data and encodes them with fixed-length codes. It works by finding the longest match between the current input and strings in the dictionary, outputting the code for that string, and adding the new string to the dictionary. LZW compression became widely used and was able to compress English text files to around half their original size on average, though it has been replaced by newer algorithms like DEFLATE that provide better compression ratios.

Uploaded by

Vlad Pașca
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

LempelZivWelch

compression algorithm

Student:
Coordinator:
Vlad Alexandru Pasca
Cristian Mihaescu

Dr. Ing.

LempelZivWelch (LZW) is a universal lossless data compression


algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was
published by Welch in 1984 as an improved implementation of the LZ78
algorithm published by Lempel and Ziv in 1978. The algorithm is simple to
implement, and has the potential for very high throughput in hardware
implementations.
The basic plan complements the basic plan for Huffman coding.
Rather than maintain
a table of variable-length codewords for fixed-length patterns in the input,
we
maintain a table of fixed-length codewords for variable-length patterns in
the input. A
surprising added feature of the method is that, by contrast with Huffman
encoding, we
do not have to encode the table.
The program works in the following way : it encodes sequences of 8bit data as fixed-length 12-bit codes. The codes from 0 to 255 represent 1character sequences consisting of the corresponding 8-bit character, and
the codes 256 through 4095 are created in a dictionary for sequences
encountered in the data as it is encoded. At each stage in compression,
input bytes are gathered into a sequence until the next character would
make a sequence for which there is no code yet in the dictionary. The code
for the sequence (without that character) is added to the output, and a
new code (for the sequence with that character) is added to the dictionary.
Here is a high level view of the encoding algorithm :
1. Initialize the dictionary to contain all strings of length one.
2. Find the longest string W in the dictionary that matches the current
input.
3. Emit the dictionary index for W to output and remove W from the
input.
4. Add W followed by the next symbol in the input to the dictionary.
5. Go to Step 2.
The decoding algorithm works by reading a value from the encoded
input and outputting the corresponding string from the initialized
dictionary. At the same time it obtains the next value from the input, and
adds to the dictionary the concatenation of the string just output and the
first character of the string obtained by decoding the next input value. The
decoder then proceeds to the next input value (which was already read in
as the "next value" in the previous pass) and repeats the process until
there is no more input, at which point the final input value is decoded
without any more additions to the dictionary.
Here is a high level view of the decoding algorithm :

1.
2.
3.
4.

Write the current string val.


Read a codeword x from the input.
Set s to the value associated with x in the symbol table.
Associate the next unasssigned codeword value to val + c in the
symbol table,
where c is the first character of s.
5. Set the current string val to s.
LZW compression example. The figure below gives details of the
operation of LZW
compression for the example input ABRACADABRABRABRA. For the first
seven
characters, the longest prefix match is just one character, so we output
the codeword
associated with the character and associate the codewords from 81
through 87 to two-character strings. Then we find prefix matches with AB
(so we output 81 and add ABR to
the table), RA (so we output 83 and add RAC to the table), BR (so we
output 82 and add
BRA to the table), and ABR (so we output 88 and add ABRA to the table),
leaving the last
A (so we output its codeword, 41).

The input is 17 ASCII characters of 7 bits each for a total of 119 bits; the
output is 12
codewords of 8 bits each for a total of 96 bitsa compression ratio of 82
percent even
for this tiny example.
And the expansion :

Uses:
LZW compression became the first widely used universal data
compression method on computers. A large English text file can typically
be compressed via LZW to about half its original size. LZW was used in the
public-domain program compress, which became a more or less standard
utility in Unix systems circa 1986. It has since disappeared from many
distributions, both because it infringed the LZW patent and because gzip
produced better compression ratios using the LZ77-based DEFLATE
algorithm.

You might also like