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

Authors:
Enzo Baccarelli;Mauro Biagi
Affiliations:
INFO-COM Department, University of Rome "La Sapienza" via Eudossiana 18, 00184 Rome, Italy;INFO-COM Department, University of Rome "La Sapienza" via Eudossiana 18, 00184 Rome, Italy
Venue:
Signal Processing
Year:
2004

Citing 6
Cited 3

The greedy procedure for resource allocation problems: Necessary and sufficient conditions for optimality

Operations Research
Integer and combinatorial optimization

Integer and combinatorial optimization
Discrete optimization

Discrete optimization
Understanding digital subscriber line technology

Understanding digital subscriber line technology
ADSL, VDSL, and Multicarrier Modulation: Wiley Series in Telecommunications and Signal Processing

ADSL, VDSL, and Multicarrier Modulation: Wiley Series in Telecommunications and Signal Processing
Novel efficient bit-loading algorithms for peak-energy-limitedADSL-type multicarrier systems

IEEE Transactions on Signal Processing

Bit and power allocation in constrained multicarrier systems: the single-user case

EURASIP Journal on Advances in Signal Processing
Physical-layer goodput maximization for power line communications

WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Low-complexity optimal discrete-rate spectrum balancing in digital subscriber lines

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

In this paper, we develop and test new algorithms for the optimal discrete bit-loading of digital subscriber loop (DSL) multicarrier (MC) systems when constraints on both the total available energy and the maximum energies per carrier are active. Although pressing spectral-compatibility issues limit performance of emerging G.DMT-based wide-band ADSL services, nevertheless, up to now none of the several published discrete-loading algorithms claiming optimality accounts for peak-energy limitations. Therefore, after proving the matroid structure of the underlying combinatorial optimization problem, we develop fast-implementable iterative greedy-type algorithms that converge to the desired optimal discrete loading. Several numerical results and comparisons carried out on standardized ADSL loops are presented that allow us to evaluate the system's losses induced by the imposed spectral-compatibility constraints.