A low complexity optimal spectrum balancing algorithm for digital subscriber lines

Authors:
Paschalis Tsiaflakis;Jan Vangorp;Marc Moonen;Jan Verlinden
Affiliations:
Department of Electrical Engineering, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, 3001 Leuven/Heverlee, Belgium;Department of Electrical Engineering, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, 3001 Leuven/Heverlee, Belgium;Department of Electrical Engineering, Katholieke Universiteit Leuven, Kasteelpark Arenberg 10, 3001 Leuven/Heverlee, Belgium;Alcatel Bell, DSL Experts Team, Francis Wellesplein 1, 2018 Antwerpen, Belgium
Venue:
Signal Processing
Year:
2007

Citing 7
Cited 6

Understanding digital subscriber line technology

Understanding digital subscriber line technology
DSL Advances

DSL Advances
Convex Optimization

Convex Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Partial crosstalk cancellation for upstream VDSL

EURASIP Journal on Applied Signal Processing
Vectored transmission for digital subscriber line systems

IEEE Journal on Selected Areas in Communications
Distributed multiuser power control for digital subscriber lines

IEEE Journal on Selected Areas in Communications

Full vectoring optimal power allocation in xDSL channels under per-modem power constraints and spectral mask constraints

IEEE Transactions on Communications
Green DSL: energy-efficient DSM

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A class of convergent algorithms for resource allocation in wireless fading networks

IEEE Transactions on Wireless Communications
Improved dual decomposition based optimization for DSL dynamic spectrum management

IEEE Transactions on Signal Processing
Low-complexity optimal discrete-rate spectrum balancing in digital subscriber lines

Signal Processing
Enabling greener DSL access networks by their stabilization with artificial noise and SNR margin

Cluster Computing

Quantified Score

Hi-index	0.09

Visualization

Abstract

In modern DSL systems, multi-user crosstalk is a major source of performance degradation. Optimal spectrum balancing (OSB) is a centralized algorithm that mitigates the effect of crosstalk by allocating optimal transmit spectra to all interfering DSL modems. By the use of Lagrange multipliers the algorithm decouples the spectrum management problem into per-tone optimization problems. The remaining issues are then finding the Lagrange multipliers that enforce the constraints and solving the per-tone optimization problems. Finding the optimal Lagrange multipliers can become complex when more than two users are considered. Starting from the single-user case, this paper presents a number of properties, which are then extended to the multi-user case and lead to an efficient search algorithm for the Lagrange multipliers. Simulations show that the number of Lagrange multiplier evaluations is as small as 20-50, independent of the number of users. Secondly, the complexity of the per-tone optimization problems grows exponentially with the number of lines in the binder. For multiple-user scenarios this becomes computationally intractable. This paper presents an efficient branch-and-bound approach for the per-tone optimization problem. Simulations show enormous complexity reductions, especially for a large number of users.