DocumentCode :
1318438
Title :
The total capacity of two-user multiple-access channel with binary output
Author :
Watanabe, Yoichiro
Author_Institution :
Dept. of Knowledge Eng. & Comput. Sci., Doshisha Univ., Kyoto, Japan
Volume :
42
Issue :
5
fYear :
1996
fDate :
9/1/1996 12:00:00 AM
Firstpage :
1453
Lastpage :
1465
Abstract :
The total capacity is evaluated for an arbitrary two-user multiple-access channel (MAC) with a binary output. The basic idea is to subdivide the MAC into a finite number of elementary MACs, i.e., a two-user MAC with binary inputs and binary outputs. These elementary MACs are classified further into two cases by the type of channel matrix. For each case, a necessary and sufficient condition of the total capacity is established by partially converting the ordinary Kuhn-Tucker condition. The solution of the necessary and sufficient condition determines the optimal distribution that achieves the total capacity of the elementary MAC. Then, for the arbitrary two-user MAC, it is shown that the total capacity is determined by evaluating the finite number of total capacities for those elementary MACs. An iteration procedure is proposed to calculate the total capacity of the MAC
Keywords :
channel capacity; iterative methods; memoryless systems; multi-access systems; Kuhn-Tucker condition; binary inputs; binary output; channel matrix; discrete memoryless channel; iteration procedure; mutual information; necessary condition; optimal distribution; sufficient condition; total capacity; two-user multiple-access channel; Artificial intelligence; Channel capacity; Decoding; Information theory; Joining processes; Knowledge engineering; Matrix converters; Mutual information; Probability distribution; Sufficient conditions;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.532885
Filename :
532885
Link To Document :
بازگشت