Achievable rate region for broadcast-relay networks with two cooperative relays

The authors consider the problem of broadcast-relay-networks with two cooperative relays. There are a transmitter, two relays and two receivers in the network. The message of the transmitter intended to the receivers has common and private parts. The relays fully cooperate with each other and with the transmitter to send the common part of the message, whereas the private parts of the message are sent through the direct links between the transmitter and receivers. The authors found an achievable rate region for this network by using the symmetric relaying strategy. In this strategy, each relay completely decodes the message of other relay. In the proof the authors took advantage of regular encoding/sliding window decoding at relays and simultaneous backward decoding analysis at receivers. Marton's broadcast code construction is used at the transmitter to split the rate between the users. Three special cases of achievable rate region are shown: (i) Kramer's achievable rate region for broadcast relay channel; (ii) Ghabeli's achievable rate for symmetric two-relay network; and (iii) Marton's achievable rate region for broadcast channel with common message. The additive white Gaussian noise model is also considered and the achievable rate region of Gaussian network is discussed.

[1]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[2]  Mohammad Reza Aref,et al.  Symmetric Relaying Strategy for Two-Relay Networks , 2008, IEEE Communications Letters.

[3]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[4]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[5]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[6]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[7]  Mohammad Reza Aref,et al.  An achievable rate region for Broadcast-Relay Networks with partial cooperation between relays , 2010, 2010 Australian Communications Theory Workshop (AusCTW).

[8]  Aleksandar Kavcic,et al.  Capacity theorems for relay channels with ISI , 2008, 2008 IEEE International Symposium on Information Theory.

[9]  Mahtab Mirmohseni,et al.  Cooperative relay-broadcast channels with causal Channel State Information , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  Ron Dabora,et al.  Broadcast Channels With Cooperating Decoders , 2006, IEEE Transactions on Information Theory.

[11]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[12]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[13]  Mehul Motani,et al.  Generalized Backward Decoding Strategies for the Relay Channel , 2007, IEEE Transactions on Information Theory.

[14]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.

[15]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[16]  Mohammad Reza Aref,et al.  Information flow in relay networks , 1981 .

[17]  Yingbin Liang,et al.  Rate Regions for Relay Broadcast Channels , 2006, IEEE Transactions on Information Theory.

[18]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[19]  Mohammad Reza Aref,et al.  Simultaneous partial and backward decoding approach for two-level relay networks , 2009, 2009 IEEE International Symposium on Information Theory.

[20]  Leila Ghabeli,et al.  An achievable rate region for a class of Broadcast-Relay Networks , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[21]  Abbas El Gamal,et al.  An Outer Bound to the Capacity Region of the Broadcast Channel , 2006, 2006 IEEE International Symposium on Information Theory.