Low-complexity optimal discrete-rate spectrum balancing in digital subscriber lines

Authors:
Martin Wolkerstorfer;Joakim JaldéN;Tomas NordströM
Affiliations:
FTW Telecommunications Research Center Vienna, Donau-City-Straíe 1, A-1220 Vienna, Austria;ACCESS Linnaeus Center, Signal Processing Lab, KTH Royal Institute of Technology, Oskulds väg 10, SE 100 44 Stockholm, Sweden;FTW Telecommunications Research Center Vienna, Donau-City-Straíe 1, A-1220 Vienna, Austria and Centre for Research on Embedded Systems (CERES), Halmstad University, Box 823, SE-30118 Halmstad ...
Venue:
Signal Processing
Year:
2013

Citing 11
Cited 1

Optimal integer bit-loading for multicarrier ADSL systems subject to spectral-compatibility limits

Signal Processing
Convex Optimization

Convex Optimization
Rate Allocation and Admission Control for Differentiated Services in CDMA Data Networks

IEEE Transactions on Mobile Computing
A low complexity optimal spectrum balancing algorithm for digital subscriber lines

Signal Processing
Branching and bounds tighteningtechniques for non-convex MINLP

Optimization Methods & Software - GLOBAL OPTIMIZATION
A branch and reduce approach for solving a class of low rank d.c. programs

Journal of Computational and Applied Mathematics
MAPEL: achieving global optimality for a non-convex wireless power control problem

IEEE Transactions on Wireless Communications
Robust spectrum management for DMT-based systems

IEEE Transactions on Signal Processing
Global Concave Minimization for Optimal Spectrum Balancing in Multi-User DSL Networks

IEEE Transactions on Signal Processing - Part I
Integrated link adaptation and power control to improve error and throughput performance in broadband wireless packet networks

IEEE Transactions on Wireless Communications
A framework for uplink power control in cellular radio systems

IEEE Journal on Selected Areas in Communications

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

Cluster Computing

Quantified Score

Hi-index	0.08

Visualization

Abstract

Discrete-rate spectrum balancing in interference-limited multi-user and multi-carrier digital subscriber lines (DSL) is a large-scale, non-convex and combinatorial problem. Previously proposed algorithms for its (dual) optimal solution are only applicable for networks with few users, while the suboptimality of less complex bit-loading algorithms has not been adequately studied so far. We deploy constrained optimization techniques as well as problem-specific branch-and-bound and search-space reduction methods, which for the first time give a low-complexity guarantee of optimality in certain multi-user DSL networks of practical size. Simulation results precisely quantify the suboptimality of multi-user bit-loading schemes in a thousand ADSL2 scenarios under measured channel data.