Date Added: Apr 2011
The power allocation that maximizes the sum rate of transceivers operating in the same frequency band is a difficult non-convex problem. In the authors' earlier work, they proved that for transceivers operating under a total power constraint, the maximum sum rate occurs at the boundary of the feasible set formed by the hyper plane representing the power constraint. This finding is nontrivial considering that they are dealing with an interference limited system. In this paper, they study the convex structure of the sum rate on the boundary of the power constraint hyper plane.