Scribd
Upload
9 views

Lecture 4

The document discusses data compression and coding theory. It covers topics like coding, uniquely decodable codes, instantaneous codes, prefix codes, and the Kraft-McMillan inequality. Equations and examples are provided to explain these concepts.

Uploaded by

anushka
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views

Lecture 4

The document discusses data compression and coding theory. It covers topics like coding, uniquely decodable codes, instantaneous codes, prefix codes, and the Kraft-McMillan inequality. Equations and examples are provided to explain these concepts.

Uploaded by

anushka
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Data Compression Lecture 4

04/02/2024 1
Coding
• Assignment of binary sequences to elements of an alphabet.
• The set of binary sequences is called a code, and the individual
members of the set are called codewords.
• An alphabet is a collection of symbols called letters
• For example, the alphabet used in writing most books consists of
the 26 lowercase letters, 26 uppercase letters, and a variety of
punctuation marks.
• ASCII code uses the same number of bits to represent each symbol.
Such a code is called a fixed-length code.
• fewer bits to represent symbols that occur more often, on the
average we would use fewer bits per symbol.
• The average number of bits per symbol is often called the rate of
the code.

04/02/2024 2
Uniquely Decodable Codes
• The average length of the code is not the only
important point in designing a “good” code

• The average length l for for each code is given by

• We would like each symbol to be assigned a


unique codeword
04/02/2024 3
Instantaneous Codewords
• Decoding Code 3
– Accumulate bits until you get a 0 or until you have three 1s.
– There is no ambiguity in this rule, and it is reasonably easy to see that this code
is uniquely decodable.
• Decoding Code 4
– Each codeword starts with a 0, and the only time we see a 0 is in the beginning
of a codeword.
– Therefore, the decoding rule is “accumulate bits until you see a 0”.
– The bit before the 0 is the last bit of the previous codeword.
• In the case of Code 3, the decoder knows the moment a code is complete.
• In Code 4, we have to wait till the beginning of the next codeword before we know
that the current codeword is complete.
• Because of this property, Code 3 is called an instantaneous code.
• While this property of instantaneous or near-instantaneous decoding is a nice
property to have, it is not a requirement for unique decodability.

4
04/02/2024
Received String Decoding Rule

01111111111 The first codeword corresponds However, after decoding eight


to a1, the next eight pairs of bits are a3s, we are left with a single
1111111 decoded as a3. (dangling) 1 that does not
Code 5 is correspond to any codeword.
used
if we assume the first codeword The string can be uniquely
corresponds to a2, we can decode decoded.
the next 16 bits as
a sequence of eight a3s

 In fact, Code 5, while it is certainly not instantaneous, is uniquely


decodable.
04/02/2024 5
• Encode the sequence a1 followed by eight a3s using this code.
• The coded sequence is 01010101010101010.
• The first bit is the codeword for a1. However, we can also decode it as
the first bit of the codeword for a2. If we use this (incorrect) decoding,
we decode the next seven pairs of bits as the codewords for a2.
• After decoding seven a2s, we are left with a single 0 that we decode as
a1. Thus, the incorrect decoding is also a valid decoding, and this code
is not uniquely decodable.
• We need a test Unique Decodability.

04/02/2024 6
Test for Unique Decodability
• Suppose we have two binary codewords a and b, where a is k bits
long, b is n bits long, and k < n.
• If the first k bits of b are identical to a, then a is called a prefix of b.
The last n−k bits of b are called the dangling suffix.
• For example, if a = 010 and b = 01011, then a is a prefix of b and the
dangling suffix is 11.
• Construct a list of all the codewords.
• Examine all pairs of codewords to see if any codeword is a prefix of
another codeword.
• Whenever you find such a pair, add the dangling suffix to the list
unless you have added the same dangling suffix to the list in a
previous iteration.

04/02/2024 7
Contd…
• Now repeat the procedure using this larger list.
• Continue in this fashion until one of the following
two things happens:
1. You get a dangling suffix that is a codeword.
2. There are no more unique dangling suffixes.
• If you get the first outcome, the code is not
uniquely decodable.
• However, if you get the second outcome, the code
is uniquely decodable.

04/02/2024 8
Example

04/02/2024 9
Prefix Codes
• Unique decodability requires examining the dangling suffixes
initially generated by codeword pairs in which one codeword is the
prefix of the other.
• If the dangling suffix is itself a codeword, then the code is not
uniquely decodable.
• A code in which no codeword is a prefix to another codeword is
called a prefix code.
• A simple way to check if a code is a prefix code is to draw the
rooted binary tree corresponding to the code. Draw a tree that
starts from a single node (the root node) and has a maximum of
two possible branches at each node.

04/02/2024 10
Codes and The Corresponding Binary Tree
•In a prefix code, the codewords
are only associated with the
external nodes
•A code that is not a prefix code,
such as Code 4, will have
codewords associated with
internal nodes.

04/02/2024 11
The Kraft-McMillan Inequality
• For any nonprefix uniquely decodable code,
we can always find a prefix code with the
same codeword lengths

04/02/2024 12
Proof

04/02/2024 13
This part of the Kraft-McMillan inequality provides a necessary
condition for uniquely decodable codes. That is, if a code is
uniquely decodable, the codeword lengths have to satisfy the
inequality.

04/02/2024 14
04/02/2024 15
04/02/2024 16
04/02/2024 17

You might also like