By Topic

An outer bound for the memoryless two-user interference channel with general cooperation

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
$31 $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

1 Author(s)
Tuninetti, D. ; ECE, Univ. of Illinois at Chicago, Chicago, IL, USA

The interference channel models a wireless network where several source-destination pairs compete for the same resources. This paper considers a 4-node network, where two nodes are sources and the other two are destinations. All nodes are full-duplex and cooperate to mitigate interference. A sum-rate outer bound is derived, which is shown to unify a number of previously derived outer bounds for special cases of cooperation or feedback. The approach is shown to extend to cooperative interference networks with more than two source-destination pairs and for any partial sum-rate. How the derived bound relates to other channel models including cognitive nodes, i.e., nodes that have non-causal knowledge of the messages of some other node, is also discussed. The bound is evaluated in Gaussian noise.

Published in:

Information Theory Workshop (ITW), 2012 IEEE

Date of Conference:

3-7 Sept. 2012