Selective Iterative Water-filling for Digital Subscriber Loops

This paper proposes a low-complexity selective iterative water-filling (SIW) algorithm that can considerably enhance the performance of IW. Unlike the highly complicated and centralized OSM, the SIW has a complexity of at most N times that of IW algorithm and is quasi-autonomous requiring very little centralized coordination. Simulation results in realistic DSL scenarios indicate that the performance of the proposed SIW can approach that of the OSM