A Formulation of the Channel Capacity of Multiple-Access Channel

被引：3

作者：

Watanabe, Yoichiro ^{[1
]}

Kamoi, Koichi ^{[2
]}

机构：

[1] Doshisha Univ, Dept Intelligent Informat Engn & Sci, Kyoto 6100321, Japan

[2] Knowledge X Inc, Wako, Saitama 3510114, Japan

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2009年 / 55卷 / 05期

关键词：

Boundary equation; channel capacity; connectedness; elementary multiple-access channel; Kuhn-Tucker conditions; local maximum; INFORMATION-THEORETIC CONSIDERATIONS; ACHIEVABLE RATE REGION; FADING CHANNELS; FEEDBACK;

D O I：

10.1109/TIT.2009.2015991

中图分类号：

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

学科分类号：

0812 ;

摘要：

The necessary and sufficient condition of the, channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence is to invoke an elementary MAC where sizes of input alphabets are not greater than the size of output alphabet. The main objective is to demonstrate that the channel capacity of an MAC is achieved by an elementary MAC included in the original MAC. The proof is quite straightforward by the very definition of the elementary MAC. The second objective is to prove that the Kuhn-Tucker conditions of the elementary MAC are sufficient (obviously necessary) for the channel capacity. The latter proof requires two distinctive properties of the MAC: Every solution of the Kuhn-Tucker conditions is a local maximum on the domain of all possible input probability distributions (IPDs), and then particularly for the elementary MAC a set of IPDs for which the value of the mutual information is not smaller than the arbitrary positive number is connected on the domain. As a result, in respect of the channel capacity, the MAC in general can be regarded as an aggregate of a finite number of elementary MACs.

引用

页码：2083 / 2096

页数：14

共 50 条

[1] CAPACITY REGION OF THE MULTIPLE-ACCESS CHANNEL
BIERBAUM, M
WALLMEIER, HM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (04) : 484 - 484
[2] The total capacity of multiple-access channel
Watanabe, Y
Kamoi, K
[J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 308 - 308
[3] ASYNCHRONOUS MULTIPLE-ACCESS CHANNEL CAPACITY
COVER, TM
MCELIECE, RJ
POSNER, EC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (04) : 409 - 413
[4] The capacity of the quantum multiple-access channel
Winter, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 3059 - 3065
[5] On the capacity of a multiple-access vector adder channel
A. A. Frolov
V. V. Zyablov
[J]. Problems of Information Transmission, 2014, 50 : 133 - 143
[6] On the capacity of a multiple-access vector adder channel
Frolov, A. A.
Zyablov, V. V.
[J]. PROBLEMS OF INFORMATION TRANSMISSION, 2014, 50 (02) : 133 - 143
[7] Classical capacity of a quantum multiple-access channel
Huang, MX
Zhang, YD
Hou, G
[J]. PHYSICAL REVIEW A, 2000, 62 (05) : 052106 - 052101
[8] Multiple-Access Channel Capacity Region with Incomplete Channel State Information
Aubry, Augusto
Tulino, Antonia M.
Venkatesan, Sivarama
[J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 2313 - 2317
[9] Channel configuration of multiple-access channel
Watanabe, Y
Kamoi, K
[J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 105 - 105
[10] Capacity Region of Cooperative Multiple-Access Channel With States
Zaidi, Abdellatif
Piantanida, Pablo
Shamai , Shlomo
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (10) : 6153 - 6174

← 1 2 3 4 5 →