2 - EE 478 Multiple User Information Theory Handout #5...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
EE 478 Handout #5 Multiple User Information Theory Thursday, October 2, 2008 Homework Set #2 Due: Thursday, October 9, 2008. 1. Capacity with input cost. Consider a DMC denoted by ( X ,p ( y | x ) , Y ), and assume that nonnegative cost b ( x ) is associated with each input symbol x ∈ X . The capacity of such channel with input cost constraint B is given by C ( B ) = max X :E( b ( X )) B I ( X ; Y ) . (a) Show that the function C ( B ) is concave in B . (b) The proof of the achievability is outlined in the lecture note. Complete the details of the proof. 2. Mutual information game. Consider the following channel: aA ±² a a A X Y Z Throughout this problem, assume that X and Z are independent, E( X ) = 0, E( X 2 ) = P , E( Z ) = 0, and E( Z 2 ) = 1. The channel capacity is given by I ( X ; Y ) = I ( X ; X + Z ). Now for the game. The noise player chooses a distribution on Z to minimize I ( X ; X + Z ) , while the signal player chooses a distribution on X to maximize I
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/24/2011 for the course ELECTRICAL ECE 571 taught by Professor Kelly during the Spring '11 term at University of Illinois, Urbana Champaign.

Page1 / 2

2 - EE 478 Multiple User Information Theory Handout #5...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online