Distributed sequence adaptation for capacity maximization of DS-CDMA systems

A game theoretic approach is used to investigate the stability of distributed adaptation algorithms. We show that for cellular CDMA systems, Nash equilibria may not exist. On the other hand, for single-cell systems, there are multiple Nash equilibria. None of them is better than the others in the Pareto sense. Furthermore, the behavior of a distributed algorithm based on an MMSE receiver is studied. Simulation results show that it converges to the Nash equilibrium which maximizes sum capacity.