DocumentCode :
3066456
Title :
Diamond channel with partially separated relays
Author :
Tandon, Ravi ; Ulukus, Sennur
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
644
Lastpage :
648
Abstract :
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.
Keywords :
Markov processes; channel capacity; decoding; Markov chain; broadcast channel; cut-set bound; decoder; deterministic functions; diamond channel capacity; partial separated relay channel; upper bound; Broadcasting; Decoding; Degradation; Educational institutions; Feedback; Relays; Transmitters; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
Type :
conf
DOI :
10.1109/ISIT.2010.5513569
Filename :
5513569
Link To Document :
بازگشت