Cooperative multiple-access encoding with states available at one transmitter

被引：89

作者：

Somekh-Baruch, Anelia ^{[1
]}

Shamai , Shlomo ^{[2
]}

Verdu, Sergio ^{[1
]}

机构：

[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA

[2] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 10期

关键词：

binning; causal side information; channel capacity; channel coding; cooperation; decoding; dirty-paper channel; Gel'fand-Pinsker channel; multiuser channels; noncausal side information;

D O I：

10.1109/TIT.2008.928977

中图分类号：

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

学科分类号：

0812 ;

摘要：

We generalize the Gel'fand-Pinsker model to encompass the setup of a memoryless multiple-access channel (MAC). According to this setup, only one of the encoders knows the state of the channel (noncausally), which is also unknown to the receiver. Two independent messages are transmitted: a common message and a message transmitted by the informed encoder. We find explicit characterizations of the capacity region with both noncausal and causal state information. Further, we study the noise-free binary case, and we also apply the general formula to the Gaussian case with noncausal channel state information, under an individual power constraint as well as a sum power constraint. In this case, the capacity region is achievable by a generalized writing-on-dirty-paper scheme.

引用

页码：4448 / 4469

页数：22

共 40 条

[1]

[Anonymous], P IEEE INT S INF THE

[2] On the achievable throughput of a multiantenna Gaussian broadcast channel [J].

Caire, G ;

Shamai, S .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) :1691-1706

[3] The multiple-access channel with partial state information at the encoders [J].

Cemal, Y ;

Steinberg, Y .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (11) :3992-4003

[4] Generalized writing on dirty paper [J].

Cohen, AS ;

Lapidoth, A .

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :227-227

[5] The Gaussian watermarking game [J].

Cohen, AS ;

Lapidoth, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (06) :1639-1667

[6] WRITING ON DIRTY PAPER [J].

COSTA, MHM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441

[7]

Csiszar I., 1981, INFORM THEORY CODING

[8] Achievable rates in cognitive radio channels [J].

Devroye, N ;

Mitran, P ;

Tarokh, V .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :1813-1827

[9] Limits on communications in a cognitive radio channel [J].

Devroye, Natasha ;

Mitran, Patrick ;

Tarokh, Vahid .

IEEE COMMUNICATIONS MAGAZINE, 2006, 44 (06) :44-49

[10]

Gallager R. G., 1968, INFORM THEORY RELIAB

← 1 2 3 4 →