On cooperative encoding with partially known non-causal interference

We consider a three-terminal Gaussian relay channel corrupted by a Gaussian interference. We assume that the interference is non-causally known to only some, i.e, not to all, the terminals. We examine two different scenarios: 1) both the source and the relay, but not the destination, know the interference and collaborate to cancel out its effect and 2) only the source knows the interference. The first scenario exhibits some symmetry and we refer to it as “informed source and relay”. The second scenario exhibits some asymmetry and we refer to it as “informed source only”. For the Gaussian relay channel with informed source and relay, we derive a lower bound on channel capacity, based on the source and the relay both employing standard dirty paper coding (DPC) and the relay using the decode-and-forward scheme. We also show that this lower bound meets with the cut-set bound, and thus gives capacity, if the channel is degraded. For the Gaussian relay channel with informed source only, we derive a lower bound on channel capacity. This lower bound is based on a generalized DPC that consists in a combination of partial cancellation of the known interference and standard DPC. In the asymmetric scenario, the performance characterizations reveal that, by opposition to Costa's initial DPC, it may be beneficial that the informed source uses a part of its power to (partially) cancel the effect of this interference so that the uninformed relay benefits from this cancellation.

[1]  Joseph Mitola,et al.  Cognitive Radio An Integrated Agent Architecture for Software Defined Radio , 2000 .

[2]  Luc Vandendorpe,et al.  Achievable Rates for the Gaussian Relay Interferer Channel with a Cognitive Source , 2009, 2009 IEEE International Conference on Communications.

[3]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[4]  Luc Vandendorpe,et al.  Cooperative Relaying With State Available Noncausally at the Relay , 2009, IEEE Transactions on Information Theory.

[5]  Elza Erkip,et al.  Increasing uplink capacity via user cooperation diversity , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[6]  Luc Vandendorpe,et al.  Lower Bounds on the Capacity of the Relay Channel with States at the Source , 2008, EURASIP J. Wirel. Commun. Netw..

[7]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[8]  Luc Vandendorpe,et al.  Cooperative relaying with state available at the relay , 2007, 2008 IEEE Information Theory Workshop.

[9]  Patrick Mitran,et al.  Limits on communications in a cognitive radio channel , 2006, IEEE Communications Magazine.

[10]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[11]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

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

[13]  Ozgur Oyman,et al.  Achievable rates in cognitive radio networks , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[14]  Luc Vandendorpe,et al.  Coding Schemes for Relay-Assisted Information Embedding , 2009, IEEE Transactions on Information Forensics and Security.

[15]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[16]  Luc Vandendorpe,et al.  Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information , 2007, 2007 IEEE International Symposium on Information Theory.

[17]  J. Nicholas Laneman,et al.  Achievable Rates for Multiple Access Channels with State Information Known at One Encoder , 2004 .

[18]  Hiroshi Sato,et al.  Two-user communication channels , 1977, IEEE Trans. Inf. Theory.

[19]  Shlomo Shamai,et al.  Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Trans. Inf. Theory.

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

[21]  Luc Vandendorpe,et al.  Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative Relay-Broadcast Channel with Non-Causal Side Information. , 2007, 2007 IEEE International Conference on Communications.

[22]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .