Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

On capacity computation for the two-user binary multiple-access channel: Solutions by cooperation

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Bühler, J. ; Heinrich-Hertz-Lehrstuhl fur Informationstheorie und Theor. Informationstechnik, Tech. Univ. Berlin, Berlin, Germany ; Wunder, G.

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.

Published in:

Sarnoff Symposium, 2010 IEEE

Date of Conference:

12-14 April 2010