Relay Channel with Orthogonal Components and Structured Interference Known at the Source

A relay channel with orthogonal components in which the destination is affected by an interference signal that is non-causally available only at the source is studied. The interference signal has structure in that it is produced by another transmitter communicating with its own destination. Moreover, the interferer is not willing to adjust its communication strategy to minimize the interference. Knowledge of the interferer's signal may be acquired by the source, for instance, by exploiting HARQ retransmissions on the interferer's link. The source can then utilize the relay not only for communicating its own message, but also for cooperative interference mitigation at the destination by informing the relay about the interference signal. Proposed transmission strategies are based on partial decode-and-forward (PDF) relaying and leverage the interference structure. Achievable schemes are derived for discrete memoryless models, Gaussian and Ricean fading channels. Furthermore, optimal strategies are identified in some special cases. Finally, numerical results bring insight into the advantages of utilizing the interference structure at the source, relay or destination.

[1]  Shlomo Shamai,et al.  Capacity Bounds and Exact Results for the Cognitive Z-Interference Channel , 2013, IEEE Transactions on Information Theory.

[2]  A. Lapidoth,et al.  Generalized writing on dirty paper , 2002, Proceedings IEEE International Symposium on Information Theory,.

[3]  David Burshtein,et al.  On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel , 2008, IEEE Transactions on Information Theory.

[4]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[5]  Shlomo Shamai,et al.  Bounds on the Capacity of the Relay Channel With Noncausal State at the Source , 2011, IEEE Transactions on Information Theory.

[6]  Mahesh K. Varanasi,et al.  Dirty Paper Coding for fading channels with partial transmitter side information , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[7]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[8]  E. Erkip,et al.  Cognitive relaying with one-sided interference , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[9]  W. Marsden.  I and J , 2012 .

[10]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[11]  A. Goldsmith,et al.  Encoding against an interferer's codebook , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[12]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

[13]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[14]  Shlomo Shamai,et al.  Bounds on the capacity of the relay channel with noncausal state information at source , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  Shlomo Shamai,et al.  On the capacity of a class of relay channels with orthogonal components and noncausal state information at source , 2010, IEEE 5th International Symposium on Wireless Pervasive Computing 2010.

[16]  François Baccelli,et al.  Interference Networks With Point-to-Point Codes , 2011, IEEE Trans. Inf. Theory.

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

[18]  Young-Han Kim,et al.  Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[19]  Deniz Gündüz,et al.  On the capacity region of a multiple access channel with common messages , 2010, 2010 IEEE International Symposium on Information Theory.

[20]  Shlomo Shamai,et al.  On exploiting the interference structure for reliable communications , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[21]  Shlomo Shamai,et al.  Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Transactions on Information Theory.

[22]  Te Sun Han,et al.  The Capacity Region of General Multiple-Access Channel with Certain Correlated Sources , 1979, Inf. Control..

[23]  J. Nicholas Laneman,et al.  Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[24]  Natasha Devroye,et al.  Structured interference-mitigation in two-hop networks , 2011, 2011 Information Theory and Applications Workshop.

[25]  Patrick Mitran,et al.  On compound channels with side information at the transmitter , 2006, IEEE Transactions on Information Theory.

[26]  Uri Erez,et al.  On robust dirty paper coding , 2008, 2008 IEEE Information Theory Workshop.

[27]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[28]  Elza Erkip,et al.  Relay channel with structured interference known at the source , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

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