By Topic

Approximate capacity of a class of Gaussian relay-interference networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Soheil Mohajer ; School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland ; Suhas N. Diggavi ; David N. C. Tse

In this paper we study the Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We examine this problem for certain regimes of channel values, when one of the cross-links is dominated by noise, resulting in Z and/or S configurations for the networks. For these Gaussian ZZ and ZS networks, we establish an approximate characterization of the rate region. The outer bounds to the capacity regions are established using genie-aided techniques that extend the methods used for the Gaussian interference channel to the relay-interference network. For the inner bound of the ZZ network, we utilize a new interference management scheme, termed interference neutralization, which was inspired by our earlier study of such deterministic networks. This technique allows for over-the-air interference removal, without the transmitters having complete access to the interfering signals.

Published in:

2009 IEEE International Symposium on Information Theory

Date of Conference:

June 28 2009-July 3 2009