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

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

2009-04-24

arxiv.org/abs/0904.3894v3

Computer Science

Information Theory

5 pages, IEEE International Symposium on Information Theory (ISIT) 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Capacity Computation for the Two-User Binary Multiple-Access Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Capacity Computation for the Two-User Binary Multiple-Access Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Capacity Computation for the Two-User Binary Multiple-Access Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-609715