Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines

摘要: We present an equivalent linear complementarity problem (LCP) formulation of the noncooperative Nash game resulting from DSL power control problem. Based on this LCP reformulation, we establish convergence popular distributed iterative waterfilling algorithm (IWFA) for arbitrary symmetric interference environment and certain asymmetric channel conditions with any number users. In case crosstalk coefficients, show that users IWFA in fact, unknowingly but willingly, cooperate to minimize a common quadratic cost function whose gradient measures received signal all This is surprising since have no intention as each maximizes its own rate reach equilibrium. due contraction property iterates. addition, reformulation enables us solve under restrictions coefficients using existing algorithms, example, Lemke's method. Indeed, use latter method benchmark empirical performance presence strong interference.