DocumentCode
2058447
Title
The total capacity of multiple-access channel
Author
Watanabe, Yoichiro ; Kamoi, Koichi
Author_Institution
KECS, Doshisha Univ., Kyoto, Japan
fYear
2002
fDate
2002
Firstpage
308
Abstract
Proves that any (memory-less) multiple-access channel (MAC) comprises finite sub-MAC´s in which the Kuhn-Tucker (KT) condition for each sub-MAC is necessary and sufficient. It means that the total capacity is evaluated for a T-user MAC with mathematical rigorousness. The KT-condition for the MAC is necessary, and is not in general sufficient for evaluating the total capacity. However, we could find out a set of sub-MAC´s where the KT-condition is sufficient. To prove the sufficiency, use is made for the boundary equation regarding the capacity region of the sub-MAC.
Keywords
channel capacity; memoryless systems; multi-access systems; KT-condition; Kuhn-Tucker condition; boundary equation; capacity region; finite sub-MACs; mathematical rigorousness; memory-less channel; multiple-access channel; total capacity; Bifurcation; Channel capacity; Equations; Information science; Knowledge engineering; Mutual information; Probability distribution; Problem-solving; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023580
Filename
1023580
Link To Document