Scribd
Upload
95 views

Huffman Coding

Huffman coding is a data compression technique that assigns variable length codes to characters based on their frequency of occurrence. It creates a tree structure with the most frequent characters at the top and assigns codes to each character, with shorter codes for more frequent characters. This presentation discusses how Huffman coding works by calculating character frequencies, building the tree, assigning codes to characters, encoding the data, and decoding it by traversing the tree. It provides an example showing how Huffman coding reduces the size of a sample string from 120 bits to 75 bits.

Uploaded by

Arul Selvam P
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
95 views

Huffman Coding

Huffman coding is a data compression technique that assigns variable length codes to characters based on their frequency of occurrence. It creates a tree structure with the most frequent characters at the top and assigns codes to each character, with shorter codes for more frequent characters. This presentation discusses how Huffman coding works by calculating character frequencies, building the tree, assigning codes to characters, encoding the data, and decoding it by traversing the tree. It provides an example showing how Huffman coding reduces the size of a sample string from 120 bits to 75 bits.

Uploaded by

Arul Selvam P
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

HINDUSTHAN

Educate Ethics Excel

College of Engineering and Technology

Presented by
Mr. P. Arul Selvam
AP/CSE/HICET

1
Huffman Coding

Educate Ethics Excel


2
Basic Definitions
 Huffman Coding is a technique of compressing data to reduce
its size without losing any of the details. It was first developed
by David Huffman.
 Huffman Coding is generally useful to compress the data in
which there are frequently occurring characters.

3
Educate Ethics Excel
How Huffman Coding works?
 Suppose the string below is to be sent over a network.

 Each character occupies 8 bits. There are a total of 15


characters in the above string. Thus, a total of 8 * 15 = 120 bits
are required to send this string.
 Using the Huffman Coding technique, we can compress the
string to a smaller size.
 Huffman coding first creates a tree using the frequencies of the
character and then generates code for each character.
4
Educate Ethics Excel
How Huffman Coding works?
 Once the data is encoded, it has to be decoded. Decoding is
done using the same tree.
 Huffman Coding prevents any ambiguity in the decoding

process using the concept of prefix code ie. a code associated


with a character should not be present in the prefix of any
other code.
 Huffman coding is done with the help of the following steps.

1. Calculate the frequency of each character in the string.

5
Educate Ethics Excel
How Huffman Coding works?
2. Sort the characters in increasing order of the frequency. These
are stored in a priority queue Q.

3. Make each unique character as a leaf node.


4. Create an empty node z. Assign the minimum frequency to the
left child of z and assign the second minimum frequency to the
right child of z. Set the value of the z as the sum of the above two
minimum frequencies.

6
Educate Ethics Excel
How Huffman Coding works?

5. Remove these two minimum frequencies from Q and add the


sum into the list of frequencies (* denote the internal nodes in the
figure above).
6. Insert node z into the tree.
7. Repeat steps 3 to 5 for all the characters.

7
Educate Ethics Excel
How Huffman Coding works?

8
Educate Ethics Excel
How Huffman Coding works?
8. For each non-leaf node, assign 0 to the left edge and 1 to the
right edge.

For sending the above string over a network, we have to send the
tree as well as the above compressed-code. The total size is given
by the table below.

9
Educate Ethics Excel
How Huffman Coding works?

Character Frequency Code Size

A 5 11 5*2 = 10

B 1 100 1*3 = 3

C 6 0 6*1 = 6

D 3 101 3*3 = 9

4 * 8 = 32 bits 15 bits   28 bits

10
Educate Ethics Excel
How Huffman Coding works?
 Without encoding, the total size of the string was 120 bits.
After encoding the size is reduced to 32 + 15 + 28 = 75.

Decoding the code


 For decoding the code, we can take the code and traverse

through the tree to find the character.


 Let 101 is to be decoded, we can traverse from the root as in

the figure below.

11
Educate Ethics Excel
How Huffman Coding works?

Decoding

12
Educate Ethics Excel
Thank
you
21AI4201 / Database Management Systems 13
Educate Ethics Excel

You might also like