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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.sigpro.2012.06.007 | Signal Processing |
Keywords | Field | DocType |
optimal solution,low-complexity optimal discrete-rate spectrum,multi-carrier digital subscriber line,certain multi-user dsl network,measured channel data,low-complexity guarantee,interference-limited multi-user,discrete-rate spectrum balancing,complex bit-loading algorithm,combinatorial problem,multi-user bit-loading scheme,combinatorial search,telecommunications,power control,dsl | Mathematical optimization,Computer science,Digital subscriber line,Power control,Combinatorial search,Channel data,Constrained optimization | Journal |
Volume | Issue | ISSN |
93 | 1 | 0165-1684 |
Citations | PageRank | References |
5 | 0.45 | 18 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Martin Wolkerstorfer | 1 | 62 | 9.43 |
Joakim Jaldén | 2 | 196 | 19.27 |
Tomas Nordström | 3 | 105 | 15.82 |