By Topic

Analysis of Deterministic Binary Interference Channels Via a General Outer Bound

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

2 Author(s)
Etkin, R.H. ; Hewlett-Packard Labs., Palo Alto, CA, USA ; Ordentlich, E.

We present a new outer bound for the general two-user discrete memoryless interference channel (IFC) and use it to establish the capacity region of the binary erasure IFC, whose determination was left open in . We also show that there are essentially two deterministic binary IFCs, in addition to the binary erasure IFC, whose capacity regions are not obvious from previous results. We determine the capacity region of one of these and apply the aforementioned general outer bound to obtain the best available bound on the maximum achievable sum-rate for the other. We also show that the new general outer bound is tight for one-sided deterministic IFCs that belong to the class studied by El Gamal and Costa.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 5 )