An achievable rate for the multiple-level relay channel

被引：156

作者：

Xie, LL ^{[1
]}

Kumar, PR

机构：

[1] Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China

[2] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2005年 / 51卷 / 04期

基金：

美国国家科学基金会;

关键词：

channel with feedback; degraded channel; multiple-relay channel; multiuser information theory; network information theory;

D O I：

10.1109/TIT.2005.844066

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

For the multiple-level relay channel, an achievable rate formula, and a simple coding scheme to achieve it, are presented. Generally, higher rates can be achieved with this coding scheme in the multiple-level relay case than previously known. For a class of degraded channels, this achievable rate is shown to be the exact capacity. An application of the coding scheme to the allcast problem is also discussed.

引用

页码：1348 / 1358

页数：11

共 14 条

[1] MULTIPLE-ACCESS CHANNELS WITH DIFFERENT GENERALIZED FEEDBACK SIGNALS [J].

CARLEIAL, AB .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (06) :841-850

[2]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[3]

COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084

[4]

GALLAGER RG, 1968, INFORMATION THEORY R

[5] Towards an information theory of large networks: An achievable rate region [J].

Gupta, P ;

Kumar, PR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (08) :1877-1894

[6]

Kramer G., 2003, P 41 ANN ALL C COMM

[7]

KRAMER G, UNPUB IEEE T INF THE

[8]

REZNIK A, 2002, P 10 ANN ALL C COMM

[9] The Gaussian parallel relay network [J].

Schein, B ;

Gallager, R .

2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, :22-22

[10]

van der Meulen E. C., 1971, Advances in Applied Probability, V3, P120, DOI 10.2307/1426331

← 1 2 →