DocumentCode :
2991103
Title :
On capacity computation for the two-user binary multiple-access channel
Author :
Bühler, Jörg ; Wunder, Gerhard
Author_Institution :
Fraunhofer German-Sino Lab. for Mobile Commun., Berlin, Germany
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
2381
Lastpage :
2385
Abstract :
This paper deals with the problem of computing the boundary of the capacity region for the memoryless two-user binary-input binary-output multiple-access channel ((2, 2; 2)-MAC), or equivalently, the computation of input probability distributions maximizing weighted sum-rate. This is equivalent to solving a difficult nonconvex optimization problem. For a restricted class of (2, 2; 2)-MACs and weight vectors, it is shown that, depending on an ordering property of the channel matrix, the optimal solution is located on the boundary, or the objective function has at most one stationary point in the interior of the domain. For this, the problem is reduced to a pseudoconcave one-dimensional optimization and the single-user problem.
Keywords :
multi-access systems; optimisation; probability; binary multiple-access channel; capacity computation; channel matrix; nonconvex optimization; probability distributions; weighted sum-rate; Capacity planning; Channel capacity; Distributed computing; Mobile communication; Multiuser channels; Mutual information; Probability distribution; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5205990
Filename :
5205990
Link To Document :
بازگشت