Implementation of Lempel-Ziv algorithm for lossless compression using VHDL 275

Implementation of Lempel-Ziv algorithm for

lossless compression using VHDL

Prof. Minaldevi K. Tank

HOD – Digital Electronics, Babasaheb Gawde Institute of Technology, Mumbai, India.

1. Introduction 2.1 Lossless compression

In computer science and information theory, data compres- Lossless compression algorithms usually exploit statisti-
sion or source coding is the process of encoding informa- cal redundancy in such a way as to represent the sender’s
tion using fewer bits than an unencoded representation data more concisely without error. Lossless compression
would use, through use of specific encoding schemes. As is possible because most real-world data has statistical
with any communication, compressed data communica- redundancy.
tion only works when both the sender and receiver of the
information understand the encoding scheme. For example, 2.2 Lossy compression
this text makes sense only if the receiver understands that it
It is also known as perceptual coding, it is possible if some
is intended to be interpreted as characters representing the
loss of fidelity is acceptable. Generally, a lossy data com-
English language. Similarly, compressed data can only be
pression will be guided by research on how people perceive
understood if the decoding method is known by the receiv-
the data in question. For example, the human eye is more
er. Compression is useful because it helps reduce the con-
sensitive to subtle variations in luminance than it is to varia-
sumption of expensive resources, such as hard disk space or
tions in color. JPEG image compression works in part by
transmission bandwidth. On the downside, compressed data
“rounding off” some of this less-important information.
must be decompressed to be used, and this extra process-
Lossy data compression provides a way to obtain the best
ing may be detrimental to some applications. For instance,
fidelity for a given amount of compression. In some cases,
a compression scheme for video may require expensive
transparent (unnoticeable) compression is desired; in other
hardware for the video to be decompressed fast enough to
cases, fidelity is sacrificed to reduce the amount of data as
be viewed as its being decompressed (the option of decom-
much as possible.
pressing the video in full before watching it may be incon-
Lossless compression schemes are reversible so that the
venient, and requires storage space for the decompressed
original data can be reconstructed, while lossy schemes ac-
video). The design of data compression schemes therefore
cept some loss of data in order to achieve higher compres-
involves trade-offs among various factors, including the de-
sion. However, lossless data compression algorithms will
gree of compression, the amount of distortion introduced (if
always fail to compress some files; indeed, any compres-
using a lossy compression scheme), and the computational
sion algorithm will necessarily fail to compress any data
resources required to compress and uncompress the data.
containing no discernible patterns. Attempts to compress
data that has been compressed already will therefore usu-
2. What Is compression?
ally result in an expansion, as will attempts to compress all
Data compression enables devices to transmit or store but the most trivially encrypted data An example of loss-
the same amount of data in fewer bits. The Compression less and lossy compression is the string: 25.888888888.
is briefly classified in two types lossless and lossy This string can be compressed as: 25.[9]8. Interpreted as,
compression “twenty five point 9 eights”, the original string is perfectly

S.J. Pise (ed.), ThinkQuest 2010, DOI 10.1007/978-81-8489-989-4_51,

© Springer India Pvt. Ltd. 2011
276
recreated, just written in a smaller form. In a lossy system,
using 26 instead, the exact original data is lost, at the benefit
of a smaller file size.
3. The Lempel-Ziv Algorithm
The Lempel-Ziv (LZ) compression methods are among
the most popular algorithms for lossless storage.The
Lempel-Ziv algorithms compress by building a diction-
ary of previously seen strings. Unlike PPM which uses
the dictionary to predict the probability of each character,
and codes each character separately based on the context,
the Lempel-Ziv algorithms code groups of characters of
varying lengths. The original algorithms also did not use
probabilities strings were either in the dictionary or not
and all strings in the dictionary were give equal probabi-
lity. Some of the newer variants, such as gzip, do take
some advantage of probabilities. At the highest level
the algorithms can be described as follows. Given a posi-
tion in a file, look through the preceeding part of the file
to find the longest match to the string starting at the
current position, and output some code that refers to that
match. Now move the finger past the match. The two
main variants of the algorithm were described by Ziv and
Lempel in two separate papers in 1977 and 1978, and
are often refered to as LZ77 and LZ78. The algorithms
differ in how far back they search and how they find
matches. The LZ77 algorithm is based on the idea of a
sliding window. The algorithm only looks for matches
in a window a fixed distance back from the current posi-
tion. Gzip, ZIP, and V.42b is (a standard modem protocal)
are all based on LZ77. TheLZ78 algorithm is based on a
more conservative approach to adding strings to the dict-
ionary. Unixcompress, and the Gif format are both based
on LZ78.
4. Why VHDL?
4.1 Using the same language it is possible to simulate as
well as design a complex logic.
4.2 Design reuse is possible
4.3 Design can be described at various levels of abstrac-
tions.
4.4 It provides for modular design and testing.
4.5 The use of VHDL has tremendously reduced the
“Time to Market “for large and small design.
4.6 VHDL designs are portable across synthesis across
synthesis and simulation tools, which adhere to the
IEEE 1076 standard.
4.7 Using VHDL makes the design device independent.
4.8 The design description can be targeted to PLD, ASIC,
FPGA very easily.
4.9 Designer has very little control at gate level.
4.10 The logic generated for the same description may vary
from tool to tool. This may be due to algorithm used
by the tools, which might be proprietary.
Prof. Minaldevi K. Tank
5. Lempel-Ziv-Welch
LZW (Lempel-Ziv-Welch) is the one that is most com-
monly used in practice. The algorithm is used to encode
byte streams (i.e., each message is a byte). The algorithm
maintains a dictionary of strings (sequences of bytes). The
dictionary is initialized with one entry for each of the 256
possible byte values—these are strings of length one. As the
algorithm progresses it will add new strings to the diction-
ary such that each string is only added if a prefix one byte
shorter is already in the dictionary. For example, John is
only added if Joh had previously appeared in the message
sequence. Each entry of the dictionary is given an index,
where these indices are typically given out incrementally
starting at 256.
6. LZ78 encoding and decoding.
The basic idea is to parse the input sequence into non-over-
lapping blocks of different lengths while constructing a
dictionary of blocks seen thus far.
6.1 Encoding
A dictionary is initialized to contain the single-character
strings corresponding to all the possible input characters
(and nothing else except the clear and stop codes if they’re
being used). The algorithm works by scanning through
the input string for successively longer substrings until it
finds one that is not in the dictionary. When such a string
is found, the index for the string less the last character (i.e.,
the longest substring that is in the dictionary) is retrieved
from the dictionary and sent to output, and the new string
(including the last character) is added to the dictionary with
the next available code. The last input character is then used
as the next starting point to scan for substrings. In this way,
successively longer strings are registered in the dictionary
and made available for subsequent encoding as single out-
put values. The algorithm works best on data with repeated
patterns, so the initial parts of a message will see little com-
pression. As the message grows, however, the compression
ratio tends asymptotically to the maximum.
6.2 Decoding
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 ad-
ditions to the dictionary. In this way the decoder builds up
a dictionary which is identical to that used by the encoder,