Research Article
Near-Optimal Multi-user Greedy Bit-Loading for Digital Subscriber Lines
@INPROCEEDINGS{10.1007/978-3-642-04648-3_16, author={Alastair McKinley and Alan Marshall}, title={Near-Optimal Multi-user Greedy Bit-Loading for Digital Subscriber Lines}, proceedings={AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers}, proceedings_a={ACCESSNETS}, year={2012}, month={5}, keywords={Digital Subscriber Lines Dynamic Spectrum Management greedy bit-loading}, doi={10.1007/978-3-642-04648-3_16} }- Alastair McKinley
Alan Marshall
Year: 2012
Near-Optimal Multi-user Greedy Bit-Loading for Digital Subscriber Lines
ACCESSNETS
Springer
DOI: 10.1007/978-3-642-04648-3_16
Abstract
This work presents a new algorithm for Dynamic Spectrum Management (DSM) in Digital Subscriber Lines. Previous approaches have achieved high performance by attempting to directly solve or approximate the multiuser spectrum optimisation problem. These methods suffer from a high or intractable computational complexity for even a moderate number of DSL lines. A new method is proposed which is a heuristic extension of the single user greedy algorithm applied to the multi-user case. The new algorithm incorporates a novel cost function that penalises crosstalk as well as considering the of a tone. Previous work has proved the performance of the new algorithm in simple 2-user scenarios. In this work we present new results which demonstrate the performance of the algorithm in larger DSL bundles. Simulation results are presented and it is shown that the new method achieves results within a few percent of the optimal solution for these scenarios.