Scribd
Upload
8 views19 pages

Source Coding Techniques in Digital Communications

The document outlines two source coding techniques: Shannon-Fano Coding and Huffman Coding. Shannon-Fano involves dividing messages into subsets based on probability and assigning bits accordingly, while Huffman Coding combines the lowest probability symbols and assigns bits until all symbols are encoded. Both methods aim to efficiently encode messages based on their probabilities.

Uploaded by

rohitkumar2022rohitkumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views19 pages

Source Coding Techniques in Digital Communications

The document outlines two source coding techniques: Shannon-Fano Coding and Huffman Coding. Shannon-Fano involves dividing messages into subsets based on probability and assigning bits accordingly, while Huffman Coding combines the lowest probability symbols and assigns bits until all symbols are encoded. Both methods aim to efficiently encode messages based on their probabilities.

Uploaded by

rohitkumar2022rohitkumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

RAGHU ENGINEERING COLLEGE

(AUTONOMOUS)

Digital Communications

Unit-5
Source Coding

Electronics and Communication Engineering


Outline
• Shannon-Fano Coding
• Huffman Coding
Shannon-Fano Encoding Algorithm:
The messages are first written in the order of decreasing probability.

Then divide the messages set into two most equiprobable subset X and Y.

The message of 1st set X is given bit 0 and message in the 2nd subset is given bit 1.

The procedure is now applied for each set separately till end.

Finally we get the code word for respective symbol.

Calculation
Huffman Coding Algorithm:

The source symbols are arranged in order of decreasing probability. Then the two of
lowest probability are assigned bit 0 and 1.

Then combine last two symbols and move the combined symbol as high as possible.

Repeat the above step until end.

Code for each symbol is found by moving backward.

Calculation

You might also like