DocumentCode :
517286
Title :
On capacity computation for the two-user binary multiple-access channel: Solutions by cooperation
Author :
Bühler, Jörg ; Wunder, Gerhard
Author_Institution :
Heinrich-Hertz-Lehrstuhl fur Informationstheorie und Theor. Informationstechnik, Tech. Univ. Berlin, Berlin, Germany
fYear :
2010
fDate :
12-14 April 2010
Firstpage :
1
Lastpage :
5
Abstract :
This paper deals with the computation of the boundary of the capacity region for the two-user memoryless multiple-access channel, which is equivalent to solving a difficult non-convex optimization problem. We study properties of the optimality conditions for a relaxation (cooperation) approach suggested in the literature. We give conditions under which a solution to the relaxed problem has the same value as the actual optimal solution and show that these conditions can in some cases be applied to construct solutions for a restricted class of discrete multiple-access channel using convex optimization.
Keywords :
convex programming; multi-access systems; multiuser channels; capacity computation; capacity region; convex optimization; cooperation approach; discrete multiple-access channel; optimality condition; relaxation approach; two-user binary multiple-access channel; two-user memoryless multiple-access channel; Broadcasting; Channel capacity; Memoryless systems; Mobile communication; Multiuser channels; Mutual information; Probability distribution; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Sarnoff Symposium, 2010 IEEE
Conference_Location :
Princeton, NJ
Print_ISBN :
978-1-4244-5592-8
Type :
conf
DOI :
10.1109/SARNOF.2010.5469729
Filename :
5469729
Link To Document :
بازگشت