TY - JOUR
T1 - Relaying in the presence of interference
T2 - Achievable rates, interference forwarding, and outer bounds
AU - Marić, Ivana
AU - Dabora, Ron
AU - Goldsmith, Andrea J.
N1 - Funding Information:
Manuscript received August 10, 2010; revised October 11, 2011; accepted December 20, 2011. Date of publication March 22, 2012; date of current version June 12, 2012. This work was supported in part by the Defense Advanced Research Projects Agency Information Theory for Mobile Ad-Hoc Networks program under Grant 1105741-1-TFIND and the Army Research Office under Multidisciplinary University Research Initiative Award W911NF-05-1-0246. The material in this paper was presented in part at the 2008 IEEE Information Theory Workshop, the 2008 IEEE International Symposium on Information Theory, the Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 2008, and the IEEE Information Theory Workshop, Taormina, Italy, May 2009.
PY - 2012
Y1 - 2012
N2 - The smallest network model that captures relaying in the presence of multiple communicating pairs causing interference to each other is the interference channel with a relay. In this paper, an achievable rate region for the interference channel with a relay is derived. Special cases of strong interference under which this region is the capacity region are presented. The results obtained demonstrate the benefits of interference forwarding at a relay. By forwarding interfering messages, the relay can improve their reception at unintended receivers and, thus, facilitate interference cancellation. We show that intentionally forwarding interfering messages can improve the achievable rates. The achievable rates and interference forwarding gains are also illustrated by numerical results in Gaussian channels. Finally, a sum-rate outer bound to the capacity region of the Gaussian interference channel with a relay is derived and compared with the achievable rate region. The cut-set bound for this channel is also derived and shown to be much looser than the new sum-rate outer bound.
AB - The smallest network model that captures relaying in the presence of multiple communicating pairs causing interference to each other is the interference channel with a relay. In this paper, an achievable rate region for the interference channel with a relay is derived. Special cases of strong interference under which this region is the capacity region are presented. The results obtained demonstrate the benefits of interference forwarding at a relay. By forwarding interfering messages, the relay can improve their reception at unintended receivers and, thus, facilitate interference cancellation. We show that intentionally forwarding interfering messages can improve the achievable rates. The achievable rates and interference forwarding gains are also illustrated by numerical results in Gaussian channels. Finally, a sum-rate outer bound to the capacity region of the Gaussian interference channel with a relay is derived and compared with the achievable rate region. The cut-set bound for this channel is also derived and shown to be much looser than the new sum-rate outer bound.
KW - Capacity
KW - decode-and-forward
KW - interference cancellation
KW - interference channels
KW - interference-forwarding
KW - network information theory
KW - relaying
UR - http://www.scopus.com/inward/record.url?scp=84862548528&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862548528&partnerID=8YFLogxK
U2 - 10.1109/TIT.2012.2191710
DO - 10.1109/TIT.2012.2191710
M3 - Article
AN - SCOPUS:84862548528
SN - 0018-9448
VL - 58
SP - 4342
EP - 4354
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 7
M1 - 6172675
ER -