TY - JOUR
T1 - Gaussian interference networks
T2 - Sum capacity in the low-interference regime and new outer bounds on the capacity region
AU - Annapureddy, V. Sreekanth
AU - Veeravalli, Venugopal V.
N1 - Funding Information:
Manuscript received February 23, 2008; revised March 22, 2009. Current version published June 24, 2009. This work was supported in part by the National Science Foundation Award CCF 0431088, through the University of Illinois, by a Vodafone Foundation Graduate Fellowship, and a grant from Texas Instruments. The material in this paper was presented in part at the Information Theory and Applications (ITA) Workshop, UCSD, San Diego, CA, January 2008 and at the IEEE International Symposium on Information Theory (ISIT), Toronto, ON, Canada, July 2008.
PY - 2009
Y1 - 2009
N2 - Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two-user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show that treating interference as noise achieves the sum capacity of the two-user Gaussian interference channel in a low-interference regime, where the interference parameters are below certain thresholds. We then generalize our techniques and results to Gaussian interference networks with more than two users. In particular, we demonstrate that the total interference threshold, below which treating interference as noise achieves the sum capacity, increases with the number of users.
AB - Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two-user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on the capacity region. Using these bounds, we show that treating interference as noise achieves the sum capacity of the two-user Gaussian interference channel in a low-interference regime, where the interference parameters are below certain thresholds. We then generalize our techniques and results to Gaussian interference networks with more than two users. In particular, we demonstrate that the total interference threshold, below which treating interference as noise achieves the sum capacity, increases with the number of users.
KW - Capacity
KW - Genie
KW - Interference channel
KW - Outer bound
KW - Treating interference as noise
UR - http://www.scopus.com/inward/record.url?scp=67650146641&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67650146641&partnerID=8YFLogxK
U2 - 10.1109/TIT.2009.2021380
DO - 10.1109/TIT.2009.2021380
M3 - Article
AN - SCOPUS:67650146641
SN - 0018-9448
VL - 55
SP - 3032
EP - 3050
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 7
ER -