arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0904.3894cs.ITmath.IT
收藏

二用户二进制多址信道容量计算

On Capacity Computation for the Two-User Binary Multiple-Access Channel

J. Bühler, G. Wunder

摘要:

本文研究无记忆二用户二进二出多址信道((2,2;2)-MAC)容量域边界的计算问题,即最大化加权和速率的输入概率分布的计算问题。这相当于解决一个困难的非凸优化问题。对于一个限制类的(2,2;2)-MAC和权重向量,它示出,取决于信道矩阵的排序属性,最优解位于边界上,或目标函数在域的内部有最多一个固定点。为此,该问题被降低到一个伪凹一维优化和单用户问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑