On stability of DS-CDMA data networks with code combining

An equation is derived whose solution(s) yield the number of transmitting mobiles in the equilibrium state(s) for a DS-CDMA network employing code combining(CC). Numerical results for a simple form of CC show that while there may exist multiple equilibria, these are typically clustered together, and do not cause a significant degradation in throughput. The results also show that CC is capable of eliminating bistability, and of having a single equilibrium state at which the throughput is slightly better than that at the desirable equilibrium state for the corresponding DS-CDMA network employing automatic repeat request.