Difference between revisions of "161-A3.1"

From Microlab Classes
Jump to navigation Jump to search
Line 72: Line 72:
  
 
{{NumBlk|::|<math>I\left(A;B\right)=H\left(Y\right)-H\left(Y\mid X\right)=2-\frac{13}{8}=0.375\,\mathrm{bits}</math>|{{EquationRef|9}}}}
 
{{NumBlk|::|<math>I\left(A;B\right)=H\left(Y\right)-H\left(Y\mid X\right)=2-\frac{13}{8}=0.375\,\mathrm{bits}</math>|{{EquationRef|9}}}}
 +
 +
Let us try to understand what this means:
 +
* If we only know <math>X</math>,
  
 
== Example 2: A Noiseless Binary Channel ==
 
== Example 2: A Noiseless Binary Channel ==

Revision as of 08:45, 2 October 2020

  • Activity: Mutual Information and Channel Capacity
  • Instructions: In this activity, you are tasked to
    • Walk through the examples.
    • Calculate the channel capacity of different channel models.
  • Should you have any questions, clarifications, or issues, please contact your instructor as soon as possible.

Example 1: Mutual Information

Given the following probabilities:

: Blood Type, : Chance for Skin Cancer
A B AB O
Very Low 1/8 1/16 1/32 1/32
Low 1/16 1/8 1/32 1/32
Medium 1/16 1/16 1/16 1/16
High 1/4 0 0 0

To get the entropies of and , we need to calculate the marginal probabilities:

 

 

 

 

(1)

 

 

 

 

(2)

And since:

 

 

 

 

(3)

We get:

 

 

 

 

(4)

 

 

 

 

(5)

Calculating the conditional entropies using:

 

 

 

 

(6)

 

 

 

 

(7)

Note that . Calculating the mutual information, we get:

 

 

 

 

(8)

Or equivalently:

 

 

 

 

(9)

Let us try to understand what this means:

  • If we only know ,

Example 2: A Noiseless Binary Channel

Example 3: A Noisy Channel with Non-Overlapping Outputs

Example 4: The Binary Symmetric Channel (BSC)

Sources

  • Yao Xie's slides on Entropy and Mutual Information