Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels

被引：2

作者：

Khormuji, Majid Nasiri ^{[1
,2
]}

Skoglund, Mikael ^{[1
,2
]}

机构：

[1] Royal Inst Technol KTH, Sch Elect Engn, SE-10044 Stockholm, Sweden

[2] Royal Inst Technol KTH, ACCESS Linnaeus Ctr, SE-10044 Stockholm, Sweden

来源：

IEEE COMMUNICATIONS LETTERS | 2012年 / 16卷 / 10期

关键词：

Capacity; noisy network coding; multiple-access relay channels; channels with state and additive interference;

D O I：

10.1109/LCOMM.2012.092112.121289

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We investigate memoryless multiple-access relay channels (MARCs) and establish the capacity of two semideterministic classes of such channels: MARCs with orthogonal receive components and state-decoupled MARCs. For both cases, the achievability and converse are proved using the noisy network coding lower bound and the cutset upper bound, respectively. Finally, the capacity of a MARC with additive Gaussian interference is quantified.

引用

页码：1529 / 1531

页数：3

共 5 条

[1] Cooperative strategies and capacity theorems for relay networks [J].

Kramer, G ;

Gastpar, M ;

Gupta, P .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3037-3063

[2]

Kramer G., P 2000 IEEE INT S IN

[3] Noisy Network Coding [J].

Lim, Sung Hoon ;

Kim, Young-Han ;

El Gamal, Abbas ;

Chung, Sae-Young .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (05) :3132-3152

[4] Offset encoding for multiple-access relay channels [J].

Sankar, Lalitha ;

Kramer, Gerhard ;

Mandayam, Narayan B. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (10) :3814-3821

[5]

Tandon R., 2010 ANN C INF SCI S

← 1 →