hw3278b - UCSD ECE287B Handout #8 Prof. Young-Han Kim...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: UCSD ECE287B Handout #8 Prof. Young-Han Kim Tuesday, October 19, 2010 Homework Set #3 Due: Tuesday, October 26, 2010 1. Partial decodeforward for causal relay channels. Consider the discrete memoryless causal relay channel p ( y 2 | x 1 ) p ( y 3 | x 1 ,x 2 ,y 2 ). (a) By adapting partial decodeforward for the DM-RC to this case, show that the capacity is lower bounded as C max p ( u,v,x 1 ) , x 2 ( v,y 2 ) min braceleftbig I ( V,X 1 ; Y 3 ) , I ( U ; Y 2 | V ) + I ( X 1 ; Y 3 | U,V ) bracerightbig , (b) Suppose Y 2 = y 2 ( X 1 ). Using the partial decodeforward lower bound in part (a) and the cutset bound, show that the capacity of this semi-deterministic DM causal relay channel is C = max p ( v,x 1 ) , x 2 ( v,y 2 ) min braceleftbig I ( V,X 1 ; Y 3 ) , H ( Y 2 | V ) + I ( X 1 ; Y 3 | V,Y 2 ) bracerightbig . (c) Consider the DM noncausal relay channel with orthogonal sender components, where X 1 = ( X 1 ,X 1 ) and p ( y 2 | x 1 ) p ( y 3 | x 1 ,x 2 ,y 2 ) = p (...
View Full Document

Ask a homework question - tutors are online