By Topic

The total capacity of multiple-access channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Watanabe, Y. ; KECS, Doshisha Univ., Kyoto, Japan ; Kamoi, K.

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.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002