Scribd
Upload
4K views1 page

Properties of Entropy in Digital Comm.

This document contains a sessional examination from 2010-11 for a Digital Communication course. It includes 3 questions assessing key concepts: 1) Proving that if a receiver knows the message being transmitted, the information carried is zero. Defining entropy and its properties. 2) Applying Shannon-Fano coding and Huffman coding procedures to given data sets. 3) Defining a Binary Symmetric Channel, calculating its capacity in terms of error probability, defining mutual information and its properties, and explaining the source coding theorem.

Uploaded by

Pravindra Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4K views1 page

Properties of Entropy in Digital Comm.

This document contains a sessional examination from 2010-11 for a Digital Communication course. It includes 3 questions assessing key concepts: 1) Proving that if a receiver knows the message being transmitted, the information carried is zero. Defining entropy and its properties. 2) Applying Shannon-Fano coding and Huffman coding procedures to given data sets. 3) Defining a Binary Symmetric Channel, calculating its capacity in terms of error probability, defining mutual information and its properties, and explaining the source coding theorem.

Uploaded by

Pravindra Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
  • Question 4
  • Question 5
  • Question 3
  • Question 2
  • Question 1

SESSIONAL EXAMINATION - II (2010-11)

College Code – 336 Roll No.-___________________________


Paper Code – EEC-601 Branch – E.C., 3rd Year, 6thSem.
Paper Title – Digital Communication Max. Marks – 15

Note - Attempt All Questions.

QUE-1 (1). Prove the statement stated as under: “If a receiver knows the message being transmitted, the amount
of information carried will be zero”.
(2). What is the Entropy? Write down the properties of entropy. (5)

QUE-2 (1). What is the Shannon–Fano Coding? Write down the procedure of this coding? Apply the Shannon–
Fano coding procedure for a given ensamble message.

 X    x1 , x2 , x3 , x4 , x5 , x6 , x7 , x8  , Assume M=2.
 P   1 4,1 8 ,1 16 ,1 16,1 16,1 4,1 16,1 8 
(2). Apply the Huffman coding procedure for the given ensamble message-

 X    x1 , x2 , x3 , x4 , x5 , x6 , x7 
, Assume M=2 (5)
 P   0.4, 0.2, 0.12, 0.08, 0.08, 0.08, 0.04 

QUE-3. (1). What is the Binary Symmetric Channel (BSC)? Calculate the formula of capacity of Binary Symmetric

Channel in terms of conditional probability of error  .

(2). What do you mean by Mutual Information? Write down the properties of Mutual Information.
(3). Explain the source coding theorem. (5)

------------------- All The Best


PRAVINDRA KUMAR

You might also like