Broadcasting over the relay channel with oblivious cooperative strategy

This paper investigates the problem of information transmission over the simultaneous relay channel with two users (or two possible channel outcomes) where for one of them the more suitable strategy is Decode-and-Forward (DF) while for the other one is Compress-and-Forward (CF). In this setting, it is assumed that the source wishes to send common and private informations to each of the users (or channel outcomes). This problem is relevant to: (i) the transmission of information over the broadcast relay channel (BRC) with different relaying strategies and (ii) the transmission of information over the conventional relay channel where the source is oblivious to the coding strategy of relay. A novel coding that integrates simultaneously DF and CF schemes is proposed and an inner bound on the capacity region is derived for the case of general memoryless BRCs. As special case, the Gaussian BRC is studied where it is shown that by means of the suggested broadcast coding the common rate can be improved compared to existing strategies. Applications of these results arise in broadcast scenarios with relays or in wireless scenarios where the source does not know whether the relay is collocated with the source or with the destination.

[1]  Arash Behboodi,et al.  On the simultaneous relay channel with informed receivers , 2009, 2009 IEEE International Symposium on Information Theory.

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

[3]  Shlomo Shamai,et al.  Oblivious Cooperation in Colocated Wireless Networks , 2006, 2006 IEEE International Symposium on Information Theory.

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

[5]  M. Yuksel,et al.  Broadcast strategies for the fading relay channel , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[6]  A. Sridharan.  Broadcast Channels , 2022 .

[7]  Shlomo Shamai,et al.  Transmitting to colocated users in wireless ad hoc and sensor networks , 2005, IEEE Transactions on Information Theory.

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

[9]  Yingbin Liang,et al.  Cooperative Relay Broadcast Channels , 2005, IEEE Transactions on Information Theory.

[10]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

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

[12]  Muriel Medard,et al.  Information-Theoretic Relaying for Multicast in Wireless Networks , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[13]  Arash Behboodi,et al.  Capacity of a class of broadcast relay channels , 2010, 2010 IEEE International Symposium on Information Theory.