A More Realistic Approach to Information-Theoretic Sum Capacity of Reverse Link CDMA Systems in a Single Cell

In this paper, we discuss the information-theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate capacity of the reverse link. This optimization problem is solved subject to a set of constraints. Previous research has suggested a minimum guaranteed quality of service plus bounds on individual transmission powers and the aggregate transmitted power as the constraints. Solving this problem, it is found out that the solution is very prone to including one station which transmits at a rate a hundred times as much as the others. Thus, it is concluded that the above constraints are not enough to produce a solution which can be realized in an actual system. It is suggested that lack of any constraint which explicitly controls either the maximum capacity of each station or the unfairness of the whole system is responsible for this shortcoming. In this paper, we include a maximum capacity constraint into the formulation and propose an algorithm for solving the resulting optimization problem. Then, empirical evidence are analyzed to show that the system actually becomes more balanced and practical after the new constraint is added to it.