Semiblind Spectrum Balancing for DSL

Moraes, Rodrigo; Dortschy, Boris; Klautau, Aldebaro; Riu, Jaume Rius i

doi:10.1109/tsp.2010.2045553

Cited by 20 publications

(15 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of these have focused on efficient, good quality and low complexity algorithms, e.g. [1]- [7]. These algorithms usually depend on some kind of convex approximation of the non-concave utility function in (3).…”

Section: System Model and Previous Workmentioning

confidence: 99%

Reduced complexity dynamic spectrum management based on a polar coordinates formulation

Moraes

Tsiaflakis

Moonen

2013

2013 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

Abstract-This paper deals with the problem of power allocation in a multi-user, multicarrier communication system. This problem arises, for example, in wireless OFDM or digital subscriber line networks. Users transmitting concurrently on the same sub-carriers cause interference to each other, and this interference is a serious limitation for system performance. We consider the problem of maximizing the weighted sum of users' data rates. The optimization variables are vectors containing the powers for all users on each tone. The problem is intrinsically difficult due to the non-concavity of the utility function. We propose to change the (cartesian) power vector by its polar coordinates vector equivalent. The main contribution of this paper is to show that at least for one dimension of the polar coordinates vector, the radius, the problem is concave and thus easy to solve. We develop an algorithm based in such a polar coordinates formulation to exploit such concavity. It is demonstrated that the algorithm we propose saves considerably on computational cost compared to previous algorithms.

show abstract

Section: System Model and Previous Workmentioning

confidence: 99%

Reduced complexity dynamic spectrum management based on a polar coordinates formulation

Moraes

Tsiaflakis

Moonen

2013

2013 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The DSM spectrum optimization problem corresponds to a challenging nonconvex problem, for which many DSM algorithms have been proposed in the literature, ranging from fully autonomous [1], [2], [3], and distributed [2], [4], [5], [6], to centralized algorithms [7], [8]. In particular, the approach of iterative convex approximation (ICA) has been recognized to be very efficient, such as the CA-DSB [2] and SCALE [5] algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…and (ii) the computational cost of solving the corresponding approximation. Such ICA algorithms (for distributed or centralized computation) are typically implemented in a per-user iterative approach, as this is demonstrated to be highly efficient [3], [2], [9], [4], [5], [6]. For instance, it is shown that these iterative implementations can solve small-to medium-scale DSL scenarios, i.e.…”

Section: Introductionmentioning

confidence: 99%

A novel class of iterative approximation methods for DSL spectrum optimization

Tsiaflakis

Glineur

2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-Spectrum optimization is a promising means to tackle the crosstalk problem in DSL systems, and corresponds to a challenging nonconvex optimization problem. Iterative convex approximation (ICA) methods have been proposed in the literature to deal with this optimization problem. These methods consist in solving a series of improving convex approximations and are typically implemented in a per-user iterative approach. In this paper we develop a novel class of iterative methods that focus explicitly on per-user iterative implementations, and which consist of improved per-user approximations that are tighter and simpler to solve (in closed-form) than state-of-theart ICA methods. As a result, the proposed methods improve the convergence speed as fewer approximations are required to converge, and display a significantly lower computational cost. Furthermore, three of the proposed methods can tackle the issue of getting stuck in bad locally optimal solutions, and hence improve solution quality with respect to existing ICA methods.

show abstract

“…Two of them can be highlighted. The first one was the development of modern signal processing techniques to avoid crosstalk effects in DSL transmissions, such as the so-called dynamic spectrum management (DSM) techniques (Cendrillon & Moonen, 2005;Moraes et al, 2010;Oksman et al, 2010;Song et al, 2002). The second one was the reduction of the used copper cable length, resulting in a consequent reduction in the attenuation imposed on the transmission signals.…”

Section: Introductionmentioning

confidence: 99%