Approximation algorithms for maximizing the information – theoretic sum capacity of reverse linkCDMAsystems

摘要

Since the introduction of multimedia services to CDMA systems, many researchers have been working on the maximization of the aggregate capacity of the reverse link. This problem looks for the optimal set of transmission powers of the stations subject to a set of constraints. One of the research directions in this field is to devise a practically realistic set of constraints and then to propose an algorithm for solving the resulting problem. Through a unified approach, introduced recently by the authors, a more general investigation of the problem, equipped with a wide range of constraints, is possible. Here, we go further and propose an approximation to reshape the objective function into a more conveniently workable one. Then, we analyze the three available formulations of the problem and show that integrating this approximation into the available algorithms has the benefit of reducing the computational cost. The paper includes the mathematics involved in the approximation and its integration into the algorithms. Also, we analyze examples to demonstrate the achievements of the proposed method.