TY - GEN

T1 - Diamond channel with partially separated relays

AU - Tandon, Ravi

AU - Ulukus, Sennur

PY - 2010

Y1 - 2010

N2 - We consider diamond channels with a general broadcast channel p(y, z|x), with outputs Z and Y at relays 1 and 2, respectively, and where the relays 1 and 2 have noiseless links of capacities Rz and Ry, respectively, to the decoder. For the case when Y and Z are deterministic functions of X, we establish the capacity. We next give an upper bound for the capacity of the class of diamond channels with a physically degraded broadcast channel, i.e., when X → Y → Z forms a Markov chain. We show that this upper bound is tight, if in addition to X → Y → Z, the output of relay 2, i.e., Y, is a deterministic function of X. We finally consider the diamond channel with partially separated relays, i.e., when the output of relay 2 is available at relay 1. We establish the capacity for this model in two cases, a) when the broadcast channel is physically degraded, i.e., when X → Y → Z forms a Markov chain, and b) when the broadcast channel is semi-deterministic, i.e, when Y = f(X). For both of these cases, we show that the capacity is equal to the cut-set bound. This final result shows that even partial feedback from the decoder to relays strictly increases the capacity of the diamond channel.

AB - We consider diamond channels with a general broadcast channel p(y, z|x), with outputs Z and Y at relays 1 and 2, respectively, and where the relays 1 and 2 have noiseless links of capacities Rz and Ry, respectively, to the decoder. For the case when Y and Z are deterministic functions of X, we establish the capacity. We next give an upper bound for the capacity of the class of diamond channels with a physically degraded broadcast channel, i.e., when X → Y → Z forms a Markov chain. We show that this upper bound is tight, if in addition to X → Y → Z, the output of relay 2, i.e., Y, is a deterministic function of X. We finally consider the diamond channel with partially separated relays, i.e., when the output of relay 2 is available at relay 1. We establish the capacity for this model in two cases, a) when the broadcast channel is physically degraded, i.e., when X → Y → Z forms a Markov chain, and b) when the broadcast channel is semi-deterministic, i.e, when Y = f(X). For both of these cases, we show that the capacity is equal to the cut-set bound. This final result shows that even partial feedback from the decoder to relays strictly increases the capacity of the diamond channel.

UR - http://www.scopus.com/inward/record.url?scp=77955676263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955676263&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2010.5513569

DO - 10.1109/ISIT.2010.5513569

M3 - Conference contribution

AN - SCOPUS:77955676263

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 644

EP - 648

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -