Skip to Main Content
The optimization of power allocation in DSL systems is a well studied non-convex problem. In recent years many algorithms have been proposed to solve this problem, but due to the non-convexity, researchers had to rely on heuristic, or exhaustive search algorithms. Iterative spectrum balancing (ISB) is one of these algorithms, that relies on iterative exhaustive search over individual power to achieve the optimization. In this paper we propose to take advantage of an approximate gradient model to reduce the complexity of ISB. Furthermore techniques such as the additional starting point (ASP) and successive optimization are used to bring the result closer to the global optimum.