Efficient Maximum Sum-Rate Computation for Multiple Access Channels in CR Networks
Peter He, Lian Yu Zhao · International Journal of Computer Theory and Engineering · 2012
achievable weighted sum-rate of the SUs, a tight pair of upper and lower bounds, as an interval, of the optimal Lagrange multiplier is proposed. It can avoid ineffectiveness or inefficiency when the dual decomposition is used. Therefore, not only is convergence of the proposed algorithm guaranteed, but efficient computation is also provided by the proposed algorithm.