Publications:Low-Complexity OptimalDiscrete-Rate Spectrum Balancing in Digital Subscriber Lines

Revision as of 05:44, 26 June 2014 by Slawek (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Do not edit this section

Keep all hand-made modifications below

Title Low-Complexity OptimalDiscrete-Rate Spectrum Balancing in Digital Subscriber Lines
Author Martin Wolkerstorfer and Joakim Jaldén and Tomas Nordström
Year 2013
PublicationType Journal Paper
Journal Signal Processing
Diva url
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.