Gaussian Interference Networks: Sum Capacity in the Low Interference Regime

被引：7

作者：

Annapureddy, V. Sreekanth ^{[1
]}

Veeravalli, Venugopal V. ^{[1
]}

机构：

[1] Univ Illinois, Dept Elect & Comp Engn, Coordinated Sci Lab, Chicago, IL 60680 USA

来源：

2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6 | 2008年

关键词：

D O I：

10.1109/ISIT.2008.4594987

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

Genie based arguments are used to derive new outer bounds on the sum capacity of the two user, symmetric three user, one-to-many and many-to-one Gaussian interference channels. Using these bounds, it is shown that treating interference as noise achieves the sum capacity in a low interference regime, where the interference parameters are below certain thresholds.

引用

页码：255 / 259

页数：5

共 17 条

[1]

ANNAPUREDDY VS, 2008, P ITA WORKSH UCSD CA

[2]

ANNAPUREDDY VS, 2008, IEEE T INF UNPUB FEB

[3]

Bresler G., 2007, P 45 ANN ALL C COMM

[4]

CASE WHERE INTERFERENCE DOES NOT REDUCE CAPACITY [J].

CARLEIAL, AB .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) :569-570

[5]

INTERFERENCE CHANNELS [J].

CARLEIAL, AB .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :60-70

[6]

CHONG HF, 2006, IEEE T INF UNPUB AUG

[7]

ON THE GAUSSIAN INTERFERENCE CHANNEL [J].

COSTA, MHM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (05) :607-615

[8]

The worst additive noise under a covariance constraint [J].

Diggavi, SN ;

Cover, TM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :3072-3081

[9]

ETKIN RH, 2007, IEEE T INF UNPUB FEB

[10]

HAN TS, 1981, IEEE T INFORM THEORY, V27, P49

← 1 2 →