- Research
- Open Access

# Modeling and optimization of the line-driver power consumption in xDSL systems

- Martin Wolkerstorfer
^{1}Email author, - Steffen Trautmann
^{2}, - Tomas Nordström
^{1, 3}and - Bakti D Putra
^{1}

**2012**:226

https://doi.org/10.1186/1687-6180-2012-226

© Wolkerstorfer et al; licensee Springer. 2012

**Received:**16 February 2012**Accepted:**30 August 2012**Published:**25 October 2012

## Abstract

Optimization of the power spectrum alleviates the crosstalk noise in digital subscriber lines (DSL) and thereby reduces their power consumption at present. In order to truly assess the DSL system power consumption, this article presents realistic line driver (LD) power consumption models. These are applicable to any DSL system and extend previous models by parameterizing various circuit-level non-idealities. Based on the model of a class-AB LD we analyze the multi-user power spectrum optimization problem and propose novel algorithms for its global or approximate solution. The thereby obtained simulation results support our claim that this problem can be simplified with negligible performance loss by neglecting the LD model. This motivates the usage of established spectral optimization algorithms, which are shown to significantly reduce the LD power consumption compared to static spectrum management.

## Keywords

- Digital subscriber lines
- Energy-efficient
- Line driver
- Optimization

## Introduction

This article analyzes the modeling and optimization of the power consumption in multi-carrier digital subscriber line (DSL) transceivers. The line-driver (LD) power consumption accounts for the largest part in the DSL power budget and scales with the transmit power (TP)[1–3]. With few exceptions[2, 4, 5], previous study has therefore focussed on minimizing the transmit sum-power[3, 6–8] through power spectral optimization, also known as dynamic spectrum management (DSM)[9]. A key feature of this objective is its separability by subcarriers, which is a prerequisite for the Lagrange decomposition[10] of the DSM problem. This decomposition results in low-complexity and even distributed DSM implementations[11–13].

We hypothesize that although TP minimization does not assume knowledge of the underlying LD power consumption, it achieves energy-efficiency at a negligible performance loss compared to a TP optimization taking the LD explicitly into account. In order to support this claim and to realistically assess energy savings by DSM it is indispensable to have an accurate model of the LD power consumption as a function of the TP. Hence, after providing more background information in Section ‘Background information’, we begin in Section ‘Line driver models’ by deriving accurate such models, which are applicable for any DSL technology and different LD classes. While we deem a proof of our hypothesis intractable, we exemplarily provide analytical and numerical evidence supporting our hypothesis based on the proposed enhanced class-AB LD model in Sections ‘Optimization models and analysis’ and ‘Empirical optimization study’, respectively. For that purpose we propose two novel numerical approaches for LD power optimization which are based on successive geometric programming (GP)[14, 15] and difference-of-convex-functions programming (DCP)[16], respectively. These techniques help us to motivate the selected scenario for simulation of a DSL network with realistic parameters under the two DSM heuristics in[2, 3], cf. the introduction in Section ‘Empirical optimization study’ for a more concise overview of our contributions. The results are rounded off in Section ‘Average performance evaluation’ by simulations demonstrating the LD power saving potential by energy-efficient multi-user DSM compared to static spectrum management and rate-maximizing DSM. Our conclusions are provided in Section ‘Conclusions’.

## Background information

### Energy-efficiency in DSL

In the last ten years, the power consumption of information and communication technology (ICT) has become an issue on top of our agendas, reflecting our concern on global warming, CO2 emissions and energy sustainability. The telecommunication sector is responsible for 25% of the ICT’s energy consumption[17] and therefore energy efficiency has naturally become an issue for industry, standardization, as well as governmental bodies. For example, the share of the fixed broadband access in the telco’s energy consumption for 2020 is estimated at around 14%[17]. A related initiative by the European commission aims at a power reduction of 50% in broadband equipment by 2015[18].

The power consumption of a DSL transceiver can be divided according to its three major parts: the *digital front-end* (the modem’s digital signal processing); the *analog front-end* (responsible for the conversion between the analog and the digital domain, including filters); and the *line driver* (the power amplifier driving the line). Depending on the used transmission profile (e.g., bandwidth) the LD power consumption can be somewhere between 30% and 60% of the modem’s total power consumption[1–3]. The main focus for energy saving in DSL lies on the LD power consumption[1, 4]. Approaches for reducing the power consumption in DSL can be classified into three categories[19]: the optimization of hardware components; dynamic rate adaptation (e.g., by spectral optimization); and low-power modes. Our focus is on the first two approaches, as we a) model the power consumption of an energy-efficient LD type, and b) study energy-efficient DSM based on derived LD power consumption models, leading to lowered transmit rates. We refer to[20, 21] for an introduction to LD design for DSL and to[1, 22–25] for an overview of various energy saving techniques for DSL.

### Line driver modeling

Current DSL systems rely on so called class-AB LDs as these provide a high degree of linearity over a large signal bandwidth. The main drawback of this type of amplifier however lies in its relatively low efficiency. Furthermore, the typical DSL signal exhibits a high crest factor (CF) with high peak values in comparison to its root-mean-square (rms) value. Even though those peak values occur with very low probability, the fixed supply voltage of a Class-AB LD must be sufficiently high to provide distortion-free amplification of the highest signal peaks. This implies that significant power savings could be obtained by modulating the supply voltage to follow the envelope of the amplified signal, as done in so-called class-H LDs. Class-G LDs[20] are class-AB LDs where the supply rail is switched, e.g., between a lower and a higher voltage level *V*_{
L
} and *V*_{
H
}, respectively. The design of a class-G LD can be differentiated by whether multiple supplies or internal charge pumps are used to provide the multiple supply voltages. In the former design the second supply voltage is typically not directly available on a DSL line card. An additional, costly DC-DC converter is required which must be included in the LD efficiency calculation. A class-H LD can be seen as a class-G LD with an infinite number of supply rails, consequently leading to a higher efficiency at the cost of a more complicated supply design. Altogether we consider the class-G design based on internal charge pumps as the most promising compromise between efficiency and complexity.

As motivated in Section ‘Introduction’, for the evaluation and optimization of the LD power consumption a realistic functional model is needed which maps the modem’s TP to its LD power consumption. An empirical model based on power measurements of a class-AB LD in ADSL2+ was presented in[2]. However, this model is not applicable to other DSL technologies or systems with different physical parameters. A circuit-level model for an LD of class-AB and G with two supplies has been presented in[4], based on the models in[26]. However, these models do not precisely account for the non-idealities of the voltage supply chain[27] (e.g., transformer loss, impedance synthesize factor, etc.) and the power loss in the hybrid circuit. Therefore, in Section ‘Class-AB line-driver power model’, we derive an enhanced class-AB LD power consumption model based on[26] that can be applied to any DSL profile, and in Section ‘Class-G line-driver power model’, we propose a novel model for a class-G LD with charge pumps.

## Line driver models

### Class-AB line-driver power model

*P*

_{ u }is the output power measured at the LD output of a line indexed by$u\in \mathcal{U}$,

*P*

_{diss}is the total power dissipated inside the LD, and

*P*

_{Hybrid}is the power consumed by the hybrid circuit. The level of

*P*

_{Hybrid}strongly depends on the hybrid implementation and topology and ranges from a few mW to several tens of mW. By the reformulation detailed in Appendix 1 the LD power consumption in (1) can be equivalently written as

where *V*_{
s
} is the supply voltage of the LD, *I*_{
Q
} is the quiescent current, and${R}_{\mathrm{line}}^{\prime}$ as defined in Appendix 1 is the transformed resistance of the line, cf. Figure1. In the ideal case the supply voltage *V*_{
s
} can be designed to cover the output voltage swing CF·*V*_{rms,ideal} described by the signal crest factor *CF* and the ideal rms LD output voltage *V*_{rms,ideal}[26].

*V*

_{ s }should include several impairments that will generally be present in real implementations and significantly influence the LD efficiency:

- 1)
The achievable signal swing at the LD output is reduced from its theoretical maximum value

*V*_{ s }by a voltage drop*V*_{drop}. Its value is typically in the range between 2 and 4 V, and determined by the design and the underlying technology of the LD output stage. - 2)
The resistances of the copper coils and other non-idealities cause an additional voltage drop over the transformer. This loss in effective signal power on the line is called transformer loss TL and can reach 0.2 to 0.5 dB for EP5 and EP7 transformers as used in xDSL central office (CO) applications.

- 3)
Another voltage drop occurs in the termination circuitry. Impedance synthesis is a commonly used concept in LD system integration [28] to reduce this loss. More precisely, only a small part of the effective receive signal termination is provided by an external resistor, while the main part is actively generated by the LD itself. The impedance synthesis factor

*m*- that is the ratio between the external resistor value and the over-all termination resistance - also determines the receive signal attenuation and cannot be made arbitrarily small. Therefore, a voltage drop by a factor*m*/(*m*+ 1) must be included in the calculation of the required LD supply voltage. While for VDSL2 systems a reasonable choice of*m*lies in the range from 3 to 6, for pure ADSL/ADSL2+ systems a more aggressive choice of*m*in the range from 6 to 20 is possible.

^{a}in (2), using (a) the mentioned ideal relation

*V*

_{ s }= CF·

*V*

_{rms,ideal}, (b) the relation

*V*

_{ s }= CF·

*V*

_{rms,ideal}+

*V*

_{drop}with headroom

*V*

_{drop}as used in[4], and (c) the relation derived in (3). From this plot it is visible that there is a considerable amount of LD power consumption that has not been taken into account by previous models.

Based on the wide deployment of class-AB LDs and the simple functional shape of our model we will focus on this LD type when analyzing the effect of the LD on energy-efficient DSM in Sections ‘Optimization models and analysis’, ‘Empirical optimization study’, and ‘Average performance evaluation’. Another energy-saving approach mentioned in Section ‘Energy-efficiency in DSL’ is the deployment of more energy-efficient LDs, as analyzed in the following section.

### Class-G line-driver power model

*V*

_{ H }from a single LD supply voltage which at the same time serves as the low class-G supply voltage

*V*

_{ L }. Under ideal conditions, a maximum voltage ratio of

*V*

_{ H }/

*V*

_{ L }= 3 can be achieved. However, taking technological limitations and various internal voltage drops into account, assuming a ratio of

*V*

_{ H }/

*V*

_{ L }≈ 2 is more realistic. The total power consumption of a class-G LD with internal charge pumps is defined as

*P*

_{Low,CP}is the LD power consumption value of an equivalent class-AB LD running continuously at the low voltage supply, and

*P*

_{High,CP}refers to the additional power consumption when the LD is switching to the high voltage supply.

*P*

_{Q,CP}is the quiescent power dissipation. The voltage level

*V*

_{ H }is thought of as the summation of

*V*

_{ L }and

*V*

_{ H }−

*V*

_{ L }, with the latter being generated by the charge pumps when needed. The consumed LD power at the low voltage

*V*

_{ L }is in analogy to (2) defined as

*V*

_{th}= (

*V*

_{ L }−

*V*

_{drop}) is given as

*μ*

_{cp}(

*P*

_{ u }) ∈ [0,1] the charge pump is used is higher than the time the output signal exceeds the threshold

*V*

_{th}, the reason being the additional ramp-up / ramp-down phases between the low and the high supply. Therefore the output signal’s MAD during charge pump usage is a combination of that when the signal is below and above

*V*

_{th}, respectively, weighted by the corresponding probabilities. The output signal’s MAD under the assumption of operating below and above the threshold is given by${V}_{\mathrm{MAD},\text{Low}}/(1-2Q(\frac{{V}_{\mathrm{th}}}{{V}_{\mathrm{rms}}}))$ and${V}_{\mathrm{MAD},\text{High}}/(2Q(\frac{{V}_{\mathrm{th}}}{{V}_{\mathrm{rms}}})$, respectively. Correspondingly we define the dynamic power

*P*

_{High,CP}as

*μ*

_{ B }= 1,

*Q*(·) is the Q-function,

*ρ*is the recharge loss, and the term${R}_{\mathrm{line}}^{\prime}\mathrm{TL}\frac{m+1}{m}$ represents the total resistance at the LD output. Comparing the total dynamic power (the sum of (5) and (9)) to that under a class-G design with two supplies (the sum of (30a) and (31) in Appendix 2) we find that the latter one is obtained by setting

*μ*

_{ A }= 0 and

*ρ*= 1. We emphasize that

*μ*

_{cp}(

*P*

_{ u }) depends not only on the output power, but, for example, also on the transformer ratio, the DSL profile, or the way in which the charge pump is loaded. The quiescent power consists, differently to that in class-AB LDs, of three main components, given as

*P*

_{Q,Low}=

*V*

_{ L }·

*I*

_{ Q }is the quiescent power dissipation of an equivalent class-AB LD continuously working at

*V*

_{ L }. The additional quiescent power dissipation of the LD when working at the high voltage supply is defined as

where *I*_{Q,classG} is the additional quiescent current in class-G mode and *L*_{classG}[*W*] refers to further fixed losses in the class-G circuitry.

^{b}. In Figure4a we see that under an ADSL2+ profile the power consumption predicted by our model of a class-G LD with charge pumps lies between that calculated by the models of a class-AB LD and a class-G LD with two supplies. Figure4b shows that the class-G LD models lead to similar power estimates for transmit powers below 14.5dBm. This is explicable by the fact that a low transmit power leads to low probabilities

*μ*

_{cp}(

*P*

_{ u }) and

*μ*

_{2S}(

*P*

_{ u }) of using the high supply in the class-G LD with charge pumps and with two supplies (see Appendix 2), respectively. Correspondingly we can approximate the power consumption of a class-G LD for low transmit power values by that of a class-AB LD in (5) that operates at the low supply voltage. However, near the maximum output power the novel class-G LD model with charge pumps significantly deviates from the class-G LD model with two supplies, similarly as the consumption of the real LD described in[29]. For example, at the maximum transmit power of 20.5dBm the two-supply class-G LD model underestimates the power consumption of the LD in[29] by as much as 44mW for ADSL2+ or 83mW for VDSL2 8b. Regarding for instance the curves for VDSL2 30a we find that the real consumption values are partially below the class-G LD models for higher transmit powers. This can be explained by the deviation of the quiescent current into the load[28] which is circuit and transmit power dependent. Differently, all the presented LD models (as well as those in[4, 26]) assume a constant quiescent current

*I*

_{ Q }that is independent of the transmit power.

In summary, the class-G design with charge pumps yields substantial energy savings compared to a class-AB LD while sparing us the DC-DC conversion needed for class-G LDs with two supplies. Furthermore, the presented LD power models have a qualitatively similar functional shape for transmit power values below 14.5dBm as they are all based on the elementary class-AB power relation in (2). In the following sections, we focus on the class-AB LD and analyze our hypothesis of Section ‘Introduction’ on the difference between LD power and TP optimization.

## Optimization models and analysis

In this section, we want to formally develop some insight into *when* a difference between LD power and TP optimization in terms of the achieved class-AB LD power might occur, how large it is, and whether this difference truly occurs under realistic network conditions.

### DSL system model and notation

*C*orthogonal subchannels (subcarriers). Our system model consists of

*U*subscriber lines sharing a single cable binder. Electromagnetic coupling between the users’ twisted pair wires leads to crosstalk noise at the receivers, which is the reason for performing the power allocation of all users jointly. The achievable rate per DMT-symbol${r}_{c}^{u}\left({\mathbf{p}}_{c}\right)$ for user$u\in \mathcal{U}=\left\{1,\dots ,U\right\}$ on subcarrier$c\in \mathcal{C}=\left\{1,\dots ,C\right\}$ as a function of the signal to interference and noise ratio (SINR) is modeled by the common gap-approximation[30]

where${\mathbf{p}}_{c}={[{p}_{c}^{1},\dots ,{p}_{c}^{U}]}^{T}$,${p}_{c}^{u}$ is the power assigned to subcarrier *c* of user *u*, and the terms${H}_{c}^{\mathit{\text{uu}}}$ and${H}_{c}^{\mathit{\text{ui}}}$ are the direct channel transfer coefficient of user *u* and the cross-channel transfer coefficient from user *i* to user *u* on subcarrier *c*, respectively. DSM implementations in standard-compliant DSL systems, including crosstalk estimation functionality, have been reported in[31, 32]. The term *Γ ;* indicates the SNR-gap to capacity depending on the modulation scheme, the targeted bit-error rate, the coding gain, and the noise margins, while${N}_{c}^{u}$ represents the total received background noise power on subcarrier *c* of user *u*, including white thermal noise, alien-crosstalk, and radio-frequency interference.

*u*is given in the form

where the parameters${\u0175}_{u}\in {\mathcal{R}}_{+}$ and${\stackrel{\u0306}{w}}_{u}\in {\mathcal{R}}_{+}$ are dependent on the hardware and system model^{c}. In the following optimization study, we will use two key features of this function: a) it is monotonously increasing, and b) concave in *P*_{
u
} (or${p}_{c}^{u},c\in \mathcal{C}$, respectively).

### Optimization problems

*R*

_{ u }and${\widehat{P}}_{u}$ the target-rate per DMT-symbol and the maximum sum-power of user

*u*, respectively. In practice numerous other objectives may be targeted besides energy consumption, including for example sum-rate[33], fairness[34], service coverage[35], the energy-per-bit[8], or weighted combinations thereof[6]. However, our choice of focusing on energy-minimization subject to rate-constraints will allow us to study various defined rate combinations. Similarly to (16), based on the model in (15) the problem of minimizing the total LD power consumption in DSL can be stated as

where for simplicity of exposition we assume identical LD models for all users. This allows us to omit the added constant${\stackrel{\u0306}{w}}_{u}$ and the factor${\u0175}_{u},u\in \mathcal{U},$ as they have no influence on the optimal solution. Note that the latter factors can easily be reintroduced under the numerical optimization approaches in Section ‘Empirical optimization study’. For instance, heterogeneous LD models are considered for the simulations in Section ‘An experiment in real-sized DSM problems using heuristics’. For brevity we will denote the optimal per-user sum-power values for the problems in (16) and (17) by${\mathbf{P}}^{\mathrm{TP}}\in {\mathcal{R}}_{+}^{U}$ and${\mathbf{P}}^{\mathrm{LD}}\in {\mathcal{R}}_{+}^{U}$, respectively.

### Analysis of the optimization problems in (16) and (17)

Before turning to the numerical optimization of the problems in (16) and (17) we analyze their solutions and the difference between their solutions in terms of LD power independently of their exact solution value. To begin with we define the set of possible solutions (the “power-region”).

#### Definition 1 (Power-region)

*The power-region associated with the problems in (16) and (17) is defined as the set*

#### Proposition 1

The sum-power vectors **P**^{TP}and **P**^{LD}achieved at a solution of the power minimization problems in (16) and (17), respectively, both lie on the boundary of the power-region$\mathcal{P}$ as defined in (18), i.e.,$\nexists \mathbf{P}\in \mathcal{P},\mathbf{P}\ne {\mathbf{P}}^{\mathrm{TP}},\mathbf{P}\preccurlyeq {\mathbf{P}}^{\mathrm{TP}}$ and$\nexists \mathbf{P}\in \mathcal{P},\mathbf{P}\ne {\mathbf{P}}^{\mathrm{LD}},\mathbf{P}\preccurlyeq {\mathbf{P}}^{\mathrm{LD}}$.

#### Proof

The proof simply follows from the monotonicity of the objectives in (16a) and (17a), respectively. □

Proposition 1 also suggests a practical heuristic approach for LD power optimization, namely through a sequence of weighted sum-power minimizations with weights based on the projected gradients of the objective functions${f}_{u}^{\mathrm{LD}}\left({P}_{u}\right)$, cf.[36] where a similar idea was applied for a rate-utility maximization problem. However, while in[36] a non-concave maximization was performed over the rate-region, here we face a concave *minimization* problem over the power-region.

The following proposition identifies the smallest problem instances where a difference between the two problems in terms of LD power may occur, and which we will further study in Section ‘Empirical optimization study’.

#### Proposition 2

Differences between the optimal solutions of the problems in (16) and (17) in terms of LD power can only occur for *U* ≥ 2 and *C* ≥ 2.

See Appendix 3 for a proof.

*ξ*for any number of users

*U*and subcarriers

*C*with powers${p}_{c}^{u}$ summing to the total power${P}_{u}=\sum _{c\in \mathcal{C}}{p}_{c}^{u}$. More precisely, we have

**P**

^{TP}, giving

The gain *ξ* for *U* = 2 users is for instance bounded by$1-1/\sqrt{U}$ (≈ 30*%*). The bounds in (21) and (22) are identical when${P}_{u}^{\mathrm{TP}}={\widehat{P}}_{u}=P,\forall u\in \mathcal{U}$.

In this section, we have located the solutions of our two optimization problems on the boundary of a power-region and identified potentially insightful problem instances. In the following section, we will use this information to study the real gain *ξ* by directly optimizing the LD power model through numerical methods.

## Empirical optimization study

We will use three approaches to obtain insights into the differences between TP and LD power minimization in terms of the LD power consumption founded on the functional model in (15): The first one is based on an efficient but possibly suboptimal successive geometric programming (GP) approximation used in order to identify problem parameters under which differences between the optimal solutions of the two optimization problems occur. While it is known[15] that the TP optimization problem can be approached by GP, our contribution is to recognize this fact for the LD power optimization problem. The second approach is based on the globally optimal solution of both problems in (16) and (17). Global optimality is a necessary property to study the power-region in Definition 1 and the location of the solutions to the problems in (16) and (17) in this region. Furthermore, it allows us to provide an exemplary scenario where provably a difference between the solutions of the two optimization problems occurs. For solving these non-convex and rate-constrained LD power and TP optimization problems we found it necessary to develop a problem-specific algorithm. It deviates in various aspects from the approaches proposed for related rate-maximization problems in[37, 38], e.g., it allows for an optimization over all subcarriers including a non-convex constraint set, and uses improved branching and bounding techniques. The third approach is by the heuristic successive convex approximation algorithms proposed in[2, 11], respectively. These two algorithms allow to study problem instances of realistic size and channel parameters.

### DSM based on successive SINR-approximation and geometric programming

Geometric programs (GP) are a class of problems which is not convex but can easily be converted into a convex form by logarithmic transformations[14]. This optimization model was applied to power control in[15, 39], where also successive GP approximations were proposed for non-convex problems based on monomial[14] or SINR approximations[11]. For a short introduction to GP and the corresponding problem transformation of the LD power optimization problem in (17) we refer to Appendix 4.

*U*=

*C*= 2) in order to identify problem parameters which lead to a substantial gain

*ξ*by LD power optimization compared to TP optimization. We generated numerous problem instances of (16) and (17) by setting${H}_{c}^{21}$ and${H}_{c}^{12}$ to all combinations out of the set {−90,−67.5,−45,−22.5,0}dB, and for each of these combinations forming all target-rate combinations sampling the users’ possible rates at 20 equi-distant rate-levels from 0 to the maximum achievable rate (i.e., 400 rate-combinations)

^{d}. After running successive GP for the problems in (16) and (17) we re-initialize the algorithm with the obtained result for the respective other problem and keep the best solution found for each problem

^{e}. Also, we multiply the per-user sum-powers by a factor of 500 before applying the LD power model in order to obtain a more realistic estimate of the LD power savings

^{f}. The result of this experiment can be summarized as follows: Significant values of

*ξ*occurred under unsymmetric settings of target-rates and crosstalk coefficients, especially so when the stronger disturber is the one having the larger target-rate, cf. Figure6. Intuitively this kind of setup results in one user operating with low sum-power (where the derivative of the LD power model in (15) is high) while the user with the larger target-rate operates with higher sum-power (corresponding to a lower derivative of the LD power model in (15)). From a sum-power perspective it may make sense to allow the strong disturber to interfere with the weak disturber due to his higher target-rates. However, from an LD power perspective the user with the low target-rates is worth protecting more due to the larger derivative of the LD power model at low sum-power values, cf. the LD power model in Figure2.

In the following section, we select a specific scenario based on these insights for further investigation.

### Global solutions of non-convex LD power optimization problems using difference-of-convex-functions programming (DCP)

*h*

_{0}(

**p**) with convex function${h}_{0}\left(\mathbf{p}\right)=-\sum _{u\in \mathcal{U}}\sqrt{\sum _{c\in \mathcal{C}}{p}_{c}^{u}}$ we can write the problem in (17) as the following DCP problem[40],

While in previous applications of DCP in the area of power control[37, 38] the problem was in fact solved as a concave minimization problem over a convex constraint set, we have additionally complicating DCP constraints in (26b). Correspondingly we developed a more general solution approach, namely a box-based branch-and-reduce algorithm initialized by a successive GP[15] solution, cf. Appendix 5 for details. Note that this DCP algorithm can similarly be applied to (optimally) solve the TP problem in (16).

*U*=

*C*= 2) identified using the heuristic in Section ‘DSM based on successive SINR-approximation and geometric programming’

^{g}. In Figure7, we show the power-regions and the solutions of the problems in (16) and (17) for varying crosstalk parameter${H}_{c}^{21}$. First, we see that both solutions

**P**

^{TP}and

**P**

^{LD}lie on the power-region, as predicted by Proposition 1. However, the solutions lie on different contour lines of the function$\sum _{u\in \mathcal{U}}\sqrt{{P}_{u}}$, meaning that they provably differ in terms of LD power consumption. While the TP solution minimizes [0.5,0.5]·

**P**over the power-region, the LD power optimal solution minimizes [0.17,0.83]·

**P**. In other words, the LD power optimum is attainable by a weighted sum-power optimization with specific weights. Searching for these weights is in fact the idea behind the projected gradient heuristic indicated in Section ‘Analysis of the optimization problems in (16) and (17)’. With a decreasing parameter${H}_{1}^{21}$ the needed sum-powers for constant target-rates decrease, leading to a decrease of the achievable gain

*ξ*by LD power optimization compared to TP minimization, cf. Figure7.

### An experiment in real-sized DSM problems using heuristics

In this section, we compare solutions obtained by two DSM heuristics and static spectrum management (SSM) in terms of their LD power: (a) the successive convex approximation algorithm[3] for the problem in (16) which is based on the convex approximation${\stackrel{~}{r}}_{c}^{u}\left({\mathbf{p}}_{c}\right)$ of the rate-function${r}_{c}^{u}\left({\mathbf{p}}_{c}\right)$ as given in Appendix 4 and introduced in[11] for a rate-maximization problem in DSL; (b) the successive LP approximation algorithm in[2] for the problem in (17) which mainly differs from the above approximation heuristic in that the approximation is linear and the approximated problems are not solved iteratively but jointly for all users, and (c) single-user water-filling considering a static background noise including the highest possible crosstalk noise based on the other systems transmitting at PSD mask. A novelty we introduce for the comparison of suboptimal DSM algorithms is that after obtaining the result of a DSM scheme we initialize the respective other DSM algorithm with this result and keep the best solutions in terms of LD power and TP objective, respectively. The purpose of this strategy is to avoid the dependency of the comparison on the initialization which might have been chosen in favor of one of the algorithms^{h}. The difference to the initialization approach in Section ‘DSM based on successive SINR-approximation and geometric programming’ is that we cross-initialize two heuristics, while in Section ‘DSM based on successive SINR-approximation and geometric programming’ we applied a single heuristic to two different problems.

^{i}. The assigned target-rates are 1, 2, or 3 Mbps and 10, 13, 16, or 19 Mbps for the CO and cabinet deployed lines, respectively, and we investigate all 12 combinations of these target-rates

^{j}.

We observed that due to the heuristic nature of both algorithms the LD power optimization did not always give a better total LD power than the TP optimization (corresponding to a negative gain *ξ* in (19)). In summary, the gain *ξ* in (19) was in the studied 12 scenarios between −0.01*%* and + 0.01*%*. DSM gives a more substantial LD power reduction compared to SSM between 20*%* and 40*%*. While this result is no definite answer to whether or not LD power optimization makes a difference compared to TP optimization, it is another indication that in practice the difference may be assumed negligible, which motivates the simplification of the optimization in this direction. However, multi-user DSM bares a substantial potential for energy-reduction compared to SSM, as we shall study further in a larger set of scenarios in the following section.

## Average performance evaluation

Differently to the previous section we will next study the possible LD power reduction by TP optimization (DSM) compared to SSM in 300 *randomly* generated network topologies with simulation parameters as specified in Section ‘An experiment in real-sized DSM problems using heuristics’. More precisely, we study two deployment scenarios, where the first one consists of 15 ADSL2+ lines with loop-lengths uniformly sampled between 800 m and 1600 m. The second type of scenarios consists of 15 VDSL cabinet-deployed lines with loop-lengths between 300 and 800 m^{k}. We compare the TP optimization algorithm in[3] and the SSM algorithm as described in the previous section. Target-rates are set by multiplying the (scenario dependent) maximum achievable per-user rates as achieved by the heuristic in[2] by factors of {0.2,0.4,0.6,0,8}. Differently to above, the crosstalk channel model is based on measurements in[43], where we perform a random cable selection for each network sample. Summarizing, the simulation setup does not exaggerate the inter-user crosstalk (e.g., by near-far scenarios or worst-case crosstalk couplings) and therefore provides a realistic evaluation of the energy savings by multi-user DSM compared to SSM.

Next, we present the average LD power consumption results together with 99% confidence intervals according to a student t-test. The average LD power consumption in the ADSL2+ scenarios obtained by the sum-rate maximizing DSM algorithm in[2] leads already to an LD power reduction compared to (spectral mask and sum-power constrained) full-power transmission of 38.70% (±0.97*%*), which has to to the maximum possible savings by TP reduction (which is obtained by reducing the TP to zero) of 85.69%. Hence, even rate-maximizing DSM can be regarded as an energy saving technology, as already argued in[44]. In the VDSL scenarios the sum-rate maximization leads to an LD power reduction compared to full-power transmission of 9.10% (±0.46*%*). The maximum possible savings are now only 32.14%, due to the lower sum-power constraint as enforced by the spectral mask, cf. the LD model for VDSL in Figure2.

## Conclusions

We derive novel realistic models of the line-driver (LD) power consumption in class-AB and G LDs as a function of the transmit power (TP) in digital subscriber lines (DSL). These models include non-idealities of the power supply and therefore result in more accurate, higher figures of LD power consumption. Based on the functional shape of the class-AB LD model we exemplarily study its optimization by dynamic spectrum management (DSM). Multi-user DSM was seen to give substantial energy savings compared to static spectrum management in a large set of DSL scenarios. Furthermore, through an empirical simulation study we were able to identify small DSM problem instances where the TP and the LD power optima provably differ in terms of LD power consumption. However, we were not able to reproduce this difference in simulations for systems of practical size, which suggests that the multi-user DSM problem can be simplified by optimizing TP instead of LD power at negligible performance loss.

## Appendix 1

### Derivation of the class-AB LD model

*n*is the transformer ratio. The average dissipated power

*P*

_{diss}can be decomposed into the quiescent power

*P*

_{ Q }and the dissipated power associated with the voltage drop in the class-AB design[46], according to

where *V*_{
s
} is the supply voltage and in (28a) we use (27), cf.[26] for details. Equation (2) derives by (1) and using (27) in (28c).

## Appendix 2

### Model of a class G LD with two supplies

*P*

_{Low,2S}and

*P*

_{High,2S}are the consumed powers when the supply voltage is

*V*

_{ L }and

*V*

_{ H }, respectively,

*P*

_{Q,2S}= (

*V*

_{ L }(1−

*μ*

_{2S}(

*P*

_{ u })) +

*V*

_{ H }

*μ*

_{2S}(

*P*

_{ u }))·

*I*

_{ Q }is the quiescent power, and

*μ*

_{2S}(

*P*

_{ u })∈ [0,1] is the fraction of time the high supply voltage is active. Assuming a threshold

*V*

_{th}= (

*V*

_{ L }−

*V*

_{drop}) for switching between the two supplies, where

*V*

_{drop}is the voltage drop in the class-AB design, and that the LD’s output voltage

*V*

_{ O }is Gaussian distributed[26] with zero mean and variance${V}_{\mathrm{rms}}^{2}$, we have${\mu}_{2S}({P}_{u})=2Q\left(\frac{{V}_{\mathrm{th}}}{{V}_{\mathrm{rms}}}\right)$,

*Q*(·) denoting the Q-function. Furthermore,

*P*

_{Low,2S}is computable as (see[26] for a similar derivation)

*V*

_{rms}in (6). Similarly, the power consumption when the supply with the higher voltage level

*V*

_{ H }is active is derived as

These formulas are equivalent to those shown in[4, 26], with the exception of the quiescent power calculation and the consideration of the resistance${R}_{\mathrm{line}}^{\prime}$ at the primary transformer side, the voltage drop *V*_{drop}, the transformer loss T*L*, and the synthesis factor *m* in the computation of the voltage-level probabilities. Not included in (29) are the extra power losses due to the necessary DC-DC conversion, cf. the discussion in Section ‘Line driver modeling’.

We note that the dynamic power (the sum of (30a) and (31)) can also be written as the sum of the power consumed by a supply *always* working at *V*_{
L
}, and that of a supply delivering (*V*_{
H
}−*V*_{
L
}) during a fraction *μ*_{2S}(*P*_{
u
}) of the time, cf. the class-G LD model with charge pump in Section ‘Class-G line-driver power model’ that is based on this interpretation.

## Appendix 3

### Proof of Proposition 2

#### Proof

For *U* = 1 and arbitrary *C* the objective in (17a) is simply a single non-linear, monotonously increasing function (a square-root) of the user’s sum-power, and omitting this function does therefore not change the optimum of the problem in (17)[47], yielding an identical formulation as of the transmit power minimization problem in (16). In the case of *C* = 1 and arbitrary *U* the target-rates in (16b) uniquely define the minimal per-user transmit powers necessary to support the target-rates[48]. However, as the LD power model in (15) as a function of the per-user transmit sum-power is monotonously increasing, any other power allocation feasible in (17b) than this minimal one would have a higher LD power consumption, and the minimum TP solution for the problem in (16) is therefore also optimal in the LD power minimization problem in (17). □

## Appendix 4

### A geometric programming (GP) approach for LD power optimization

*c*

_{ k }≥ 0 and${\alpha}_{i}^{k}\in \mathcal{R},1\le i\le \mathit{\text{CU}}$. We refer to[14] for a more detailed introduction to GPs. Introducing auxiliary variables

*t*

_{ u },$u\in \mathcal{U}$, for the sum-power terms$\sum _{c\in \mathcal{C}}{p}_{c}^{u}$ in (17a) we obtain the equivalent formulation

According to the definitions above, the objective in (32a) is a posynomial function and the auxiliary constraints in (32b) have posynomial form[14]. As noted in[15] the constraints in (16b) can also be written as posynomial constraints when using for instance the SINR approximation[11]${r}_{c}^{u}\left({\mathbf{p}}_{c}\right)\approx {\stackrel{~}{r}}_{c}^{u}({\mathbf{p}}_{c})={\alpha}_{c}^{u}{log}_{2}\left({\text{SINR}}_{c}^{u}\left({\stackrel{~}{\mathbf{p}}}_{c}\right)\right)+{\beta}_{c}^{u},c\in \mathcal{C},u\in \mathcal{U}$, where${\text{SINR}}_{c}^{u}$ is the SINR in (14) and${\stackrel{~}{p}}_{c}^{u},c\in \mathcal{C},u\in \mathcal{U},$ is the approximation point. To see this, one needs to introduce additional variables${\stackrel{~}{t}}_{c}^{u}$,$c\in \mathcal{C},u\in \mathcal{U}$, replacing the total noise$({\sum}_{i\in \mathcal{U}\setminus u}{H}_{c}^{\mathit{\text{ui}}}{p}_{c}^{i}+{N}_{c}^{u})$ user *u* receives on subcarrier *c*. The thereby created additional constraints${\stackrel{~}{t}}_{c}^{u}\ge ({\sum}_{i\in \mathcal{U}\setminus u}{H}_{c}^{\mathit{\text{ui}}}{p}_{c}^{i}+{N}_{c}^{u})$,$c\in \mathcal{C},u\in \mathcal{U}$, are posynomial expressions. Under these additional variables the constraints in (16c) and (16d)-(16e) can be seen to be already given in posynomial and monomial form, respectively. Hence, we have that the problem in (32) can be approximated as a GP which is efficiently and optimally solvable by convex optimization software[49].

## Appendix 5

### A box-based branch-and-reduce algorithm

Algorithm 1 schematically describes the proposed scheme for global optimization of the DCP problem in (26). The idea behind the method is to first enclose the set defined by the mask-constraints in (26c) by a box, cf. Line 2, and to successively split this set (“branching”) into smaller boxes, cf. Line 4. We observed that box-based branching repeatedly outperforms simplicial branching[50]. We believe this is due to the conservative initial search space in simplicial branching, which is a simplex with corner points$\mathbf{0},\left(\sum _{u\in \mathcal{U},c\in \mathcal{C}}{\widehat{p}}_{c}^{u}\right){\mathbf{e}}_{u},u\in \mathcal{U}$, where **e**_{
u
}is the *u*’th unit vector. Lower bounds on the objective value in any box are computed by linear programming (LP) after linearly approximating (underestimating) all convex functions *g*_{
u
} (**p**) and all concave functions$-{h}_{u}\left(\mathbf{p}\right),u\in \mathcal{U}$, cf. Line 5. The fact that such a linear underestimation of convex and concave functions can easily be found[50] is the key advantage of the DCP formulation in (26). Differently to[50] we propose to apply linear approximations of all convex functions${g}_{u}\left(\mathbf{p}\right),u\in \mathcal{U}$, not only on a single point but on various points in the considered box, e.g., in regular intervals between the center point and each corner point. Based on the lower-bounds and the best feasible solution found so far (the “incumbent”) the created boxes are either further split or discarded if the lower-bound lies above the upper bound, cf. Line 8. More precisely, in[37] a transformation of variables into dB-scale was proposed. Similarly we perform the branching (bisection) in dB-scale, which has the advantage that we still consider the full search-space beginning at a power allocation of zero. More precisely, in Line 4, we subdivide a box along its longest edge in dB-scale. In case the value of the minimal element in splitting dimension is zero we use a lower value based on a fixed ratio to the value of the maximal element in splitting dimension.

Another technique integrated in Algorithm 1 is that of range reduction[51, 52]. Briefly speaking, bounds of constraints in the LP used to compute lower bounds can be tightened based on the obtained optimal dual variables associated with these constraints and the current incumbent solution, cf.[51, 52] for details. Note that we omitted any local search step for improving the incumbent solution as is typically done in continuous BnB methods[52]. We believe the incumbent initialization in Line 1 by the successive geometric programming described in Appendix 4 is tight enough for the considered applications to make such a local search in the BnB process redundant. We refer to[50] for a detailed description of a basic *simplicial* branch-and-bound algorithm applied to a general DCP problem, and to[51] for an introduction to the range-reduction technique, as well as to[53] for an application of range reduction in a specific DCP problem with DCP functions in the objective only.

### Algorithm 1 Box-based Branch-and-Reduce Algorithm

- 1:
Initialize the incumbent using a heuristic solutionbased on successive geometric programming, cf.Section ‘DSM based on successive SINR-approximation and geometric programming’.

- 2:
Initialize the first open, currently active box withminimal and maximal corner-points$\mathbf{0}?{\mathcal{R}}^{\mathit{\text{UC}}}$ and$\widehat{\mathbf{p}}?{\mathcal{R}}^{\mathit{\text{UC}}}$.

- 3:
**while**{Any box is open}**do** - 4:
Branching: Generate two new open boxes bysplitting the currently active box in half indB-scale in the dimension of its longest edge.

- 5:
Bounding: Compute objective lower bounds forboth new boxes using an underestimating LP[50]to the DCP problem in (26) with reducedvariable ranges[51].

- 6:
Reduction: Try a range-reduction based on thecurrent incumbent solution[51], and repeat thelower-bound LP if a range-reduction wasachieved.

- 7:
Incumbent Update: Update the incumbentby testing the 2

^{CU-1}new corner points createdthrough branching and the LP solutions forfeasibility in (26). - 8:
Pruning: Close all boxes with a lower bound abovethe incumbent solution.

- 9:
Selection: Choose the open box with the lowestlower bound as the new active box.

## Endnotes

^{a}The parameters chosen for ADSL2+ are *R*_{line} = 100*Ω*, *n* = 1.25, CF = 5.3,${\widehat{P}}_{u}=19.5$dBm, T*L* = 0.5dB, *m* = 5, *I*_{
Q
}= 5mA, *V*_{drop}= 4V, and *P*_{Hybrid} = 0. The parameters for VDSL deviating from these values are *I*_{
Q
}= 11.1mA and${\widehat{P}}_{u}=11.5$dBm.

^{b}The selected profiles correspond to downstream ADSL2+ (Annex A)[41] and VDSL2[45] profiles 8b (Annex A), 17a (Annex B), and 30a. The chosen parameters common to all LD models are *R*_{line} = 100*Ω*, *n* = 1.4 (as in[29]),${\widehat{P}}_{u}=20.5$dBm (14.5dBm) for ADSL2+ and VDSL2 profile 8b (VDSL2 profile 17a and 30a), TL = 0.5dB, *m* = 5, *V*_{drop} = 5V, and *P*_{Hybrid} = 0. For the class-AB model we assume CF=5.3. The quiescent currents *I*_{
Q
}∈0.95∗{7.6,9.8,12,18}mA for the four profiles were selected according to the values suggested in[29] and scaled by a factor of 0.95 that accounts for the diversion of quiescent current to the load[28]. While for the class-AB LD the optimal supply voltage in (3) is assumed, for the class-G LD with two supplies we consider *V*_{
H
}= 24V, and for the LD with charge pumps we set *V*_{
H
}= 24V + *V*_{drop,CP}, *I*_{Q,classG}= 0.3mA, *L*_{classG} = 0mW, and *ρ* = 1.5dB, where *V*_{drop,cp}= 2V represents an additional voltage drop due to the charging circuitry and a margin necessary due to the permanent discharging of the charge pump capacitors. For both class-G LD types we set *V*_{
L
}= 12V and assume a threshold for switching between high and low supply of *V*_{th} = *V*_{
L
}−*V*_{drop}. The usage probability *μ*_{cp}(*P*_{
u
}) is obtained through simulations for different values of *P*_{
u
}. The charge pump is assumed to be active for a time-frame of 0.11*μ* s (ADSL2+ and VDSL2 8b), 0.04*μ* s (VDSL2 17a) or 0.05*μ* s (VDSL2 30a) when *V*_{rms} exceeds *V*_{th}. Additionally it is assumed to be active for 0.35*μ* s and 0.5*μ* s before and after this time-frame, which accounts for the charging and discharging of the charge pump capacitors, respectively.

^{c}The specific parameters assumed throughout the rest of the article are those mentioned in Section ‘Class-AB line-driver power model’ with the exception of *n* = 1.2, CF=5, and the power limit${\widehat{P}}_{u}=19.9$dBm used for ADSL2+ lines.

^{d}The remaining relevant parameters are${H}_{c}^{\mathit{\text{uu}}}=1$, Γ = 12.3dB, *Δ* = 4.3125·10^{3}[Hz],${N}_{c}^{u}=1{0}^{-140/10}\xb7\Delta $[mW],${\widehat{p}}_{c}^{u}=1{0}^{-40/10}\xb7\Delta $[mW],$u\in \mathcal{U}$,$c\in \mathcal{C}$,$\widehat{B}=\infty $.

^{e}This sequential re-initialization process is stopped in case the best solution found for both problems does not improve for more than three consecutive iterations.

^{f}By multiplication with 500 we heuristically scale the transmit sum-power values to that of a system with 1000 subcarriers in order to obtain LD power values through our LD power model which are somewhat comparable to those under more realistic system parameters in the following sections.

^{g}The relevant selected parameters are those of Section ‘DSM based on successive SINR-approximation and geometric programming’ with the exception of *R*_{1} = 41.36[bits/frame], *R*_{2} = 5.9[bits/frame],${H}_{c}^{12}=-67.5$dB and the initial value${H}_{c}^{21}=-22.5$dB,$c\in \mathcal{C}=\{1,2\}$.

^{h}The sequential re-initialization process is stopped if no improvement of the best solution found by any of the algorithms was detected for two consecutive iterations. The PSD for the TP optimization and its first approximation was initialized at a low level of −120dBm per subcarrier and user. The trust-region used in the LD power optimization scheme in[2] is set to −70dBm per subcarrier and user after being initialized with the solution of the sequential TP minimization algorithm in[3].

^{i}We consider the bandplan setting for fiber-to-the-exchange, mask variant B, and un-notched mask M2, which would not be used in practice in this form due to the high ingress noise into ADSL lines but serves our purpose to imitate the insightful scenarios found in Section ‘DSM based on successive SINR-approximation and geometric programming’.

^{j}The maximum rate for the VDSL lines in the considered scenario as found by the LD power optimization algorithm[2] is approximately 19.9Mbps.

^{k}Simulation parameters for both DSL technologies are as specified in Section ‘An experiment in real-sized DSM problems using heuristics’, except that for VDSL we use the bandplan specified in[42] for fiber-to-the-cabinet, mask variant A-M1.

## Declarations

### Acknowledgements

This work has been funded by BMVIT/FFG under the program FIT-IT. The Competence Center FTW Forschungszentrum Telekommunikation Wien GmbH was funded within the program COMET—Competence Centers for Excellent Technologies by BMVIT, BMWA, and the City of Vienna. The COMET program was managed by the FFG.

## Authors’ Affiliations

## References

- Hooghe K, Guenach M: Towards energy-efficient packet processing in access nodes. In
*IEEE Global Communications Conference 2011 (Globecom’11)*. Houston, Texas, USA; 2011.Google Scholar - Guenach M, Nuzman C, Maes J, Peeters M: Trading Off Rate and Power Consumption in DSL Systems. In
*International Workshop on Green Communications, IEEE GLOBECOM*. Honolulu, Hawaii; 2009.Google Scholar - Wolkerstorfer M, Statovci D, Nordström T: Dynamic Spectrum Management for Energy-Efficient Transmission in DSL. In
*IEEE International Conference on Communications Systems 2008 (ICCS’08)*. Guangzhou, China; 2008.Google Scholar - Guenach M, Nuzman C, Hooghe K, Maes J, Peeters M: Reduced dimensional power optimization using class AB and G line drivers in DSL. In
*International Workshop on Green Communications, IEEE GLOBECOM 2010*. USA, Miami; 2010.Google Scholar - M Guenach, C Nuzman, K Hooghe, J Maes, M Peeters, in
*On power-efficient usage of line drivers in copper-based access networks, in IEEE International Energy Conference and Exhibition (EnergyCon’10)*(Manama, Bahrain, 2010), pp. 131–136Google Scholar - Tsiaflakis P, Yi Y, Chiang M, Moonen M, Green DSL: Energy-Efficient DSM. In
*IEEE International Conference on Communications 2009 (ICC’09)*. Dresden, Germany; 2009.Google Scholar - Guenach M, Nuzman C, Maes J, Peeters M: On Power Optimization in DSL Systems. In
*IEEE International Conference on Communications Workshops (ICC’09)*. Dresden, Germany; 2009.Google Scholar - Wolkerstorfer M: Energy-efficient resource allocation in multi-carrier digital subscriber lines.
*PhD thesis*. Vienna University of Technology, Vienna, Austria, 2012Google Scholar - Song KB, Chung ST, Ginis G, Cioffi J: Dynamic spectrum management for next-generation DSL systems.
*IEEE Commun. Mag*2002, 40(10):101-109. 10.1109/MCOM.2002.1039864View ArticleGoogle Scholar - Johansson B, Soldati P, Johansson M: Mathematical decomposition techniques for distributed cross-layer optimization of data networks.
*IEEE J. Sel. Areas Commun*2006, 24(8):1535-1547.View ArticleGoogle Scholar - Papandriopoulos J, Evans J: S C A L E: A low-complexity distributed protocol for spectrum balancing in multiuser DSL networks.
*IEEE Trans. Inf. Theory*2009, 55(8):3711-3724.MathSciNetView ArticleGoogle Scholar - Tsiaflakis P, Diehl M, Moonen M: Distributed spectrum management algorithms for multiuser DSL networks.
*IEEE Trans. Signal Process*2008, 56(10):4825-4843.MathSciNetView ArticleGoogle Scholar - Wolkerstorfer M, Jaldén J, Nordström T: Column generation for discrete-rate multi-user and multi-carrier power control.
*IEEE Trans. Commun*2012, 60(9):2712-2722. doi: 10.1109/TCOMM.2012.070912.110444View ArticleGoogle Scholar - Boyd S, Kim SJ, Vandenberghe L, Hassibi A: A tutorial on geometric programming.
*Optimiz Eng*2007, 8: 67-127. 10.1007/s11081-007-9001-7MathSciNetView ArticleMATHGoogle Scholar - Chiang M, Tan C, Palomar D, O’Neill D, Julian D: Power control by geometric programming.
*IEEE Trans. Wirel. Commun*2007, 6(7):2640-2651.View ArticleGoogle Scholar - Horst R, Pardalos P, Thoai N:
*Introduction to Global Optimization, Volume 48 of Nonconvex Optimization and its Applications*. Kluwer Academic Publishers, Dordrecht; 2000.Google Scholar - The Climate Group: SMART 2020: Enabling the low carbon economy in the information age. 2008.Google Scholar
- EC Directorate-General JRC Joint Research Centre: Institute for Energy, Renewable Energy Unit: Code of Conduct on Energy Consumption of Broadband Equipment.
*Version 4*2011.Google Scholar - Bolla R, Davoli F, Bruschi R, Christensen K, Cucchietti F, Singh S: The potential impact of green technologies in next-generation wireline networks: Is there room for energy saving optimization.
*IEEE Commun. Mag*2011, 49(8):80-86.View ArticleGoogle Scholar - Piessens T, Steyaert M:
*Design and analysis of high efficiency line drivers for xDSL*. Kluwer Academic Publishers, Dordrecht; 2004.Google Scholar - Serneels B, Steyaert M:
*Design of High Voltage xDSL Line Drivers in Standard CMOS*. Springer, Dordrecht; 2008.View ArticleGoogle Scholar - Guenach M, Nuzman C, Maes J, Peeters M, Li Y, Van Bruyssel D, Defoort F: Power efficient copper access.
*Bell Labs Tech J*2010, 15(2):117-129. 10.1002/bltj.20444View ArticleGoogle Scholar - Wolkerstorfer M, Statovci D, Nordström T: Energy-Saving by Low-Power Modes in ADSL2.
*Elsevier Comput. Netws Special Issue on Green Communication Networks*2012, 56(10):2468-2480.View ArticleGoogle Scholar - Kamitsos I, Tsiaflakis P, Ha S, Chiang M: Stable Sleeping in DSL Broadband Access: Feasibility and Tradeoffs. In
*IEEE Global Communications Conference 2011 (Globecom’11)*. Houston, Texas, USA; 2011.Google Scholar - Hooghe K, Guenach M: Impact of FTTN architecture on access node energy efficiency. In
*IEEE Symposium on Communications and Vehicular Technology in the Benelux 2010 (SCVT’10)*. Enschede, The Netherlands; 2010.Google Scholar - Pierdomenico J, Wurcer S, Day B, A 684-mW adaptive supply full-rate ADSL CO driver:
*IEEE J. Solid-State Circ*. 2002, 37(12):1831-1838. 10.1109/JSSC.2002.804343View ArticleGoogle Scholar - Wurcer S: Carefully evaluate your ADSL line-driver efficiency.
*Commun. Syst. Design*2003, 2003: 21-23.Google Scholar - Stephens R: Active output impedance for ADSL line drivers.
*Texas Instrum. Analog Appl. J*2002, Q4: 24-31.MathSciNetGoogle Scholar - Gated-Class H, TI: Dual-Port VDSL2 Line Driver. Tech. Rep. THS 6226, Texas Instruments. 2011.Google Scholar
- Golden P, Dedieu H, Jacobsen K:
*Fundamentals of DSL Technology*. Auerbach Publications, Boca Raton; 2006.View ArticleGoogle Scholar - Cendrillon R, Liming F, Chou J, Long G, Hung C, Wei D: D S M from theory to practice. In
*IEEE Global Communications Conference 2008 (GLOBECOM’08)*. New Orleans, LA, USA; 2008.Google Scholar - Medeiros E, Lindqvist N, Monteiro M, Abrahim H, Lindqvist F, Dortschy B, Klautau A: DSM performance on practical DSL systems based on estimated crosstalk channel information. In
*European Signal Processing Conference 2009 (Eusipco’09)*. Glasgow, Scotland; 2009.Google Scholar - Cendrillon R, Yu W, Moonen M, Verlinden J, Bostoen T: Optimal multiuser spectrum balancing for digital subscriber lines.
*IEEE Trans. Commun*2006, 54(5):922-933.View ArticleGoogle Scholar - Tsiaflakis P, Yi Y, Chiang M, Moonen M: Fair greening for DSL broadband access.
*ACM SIGMETRICS Perf. Eval Rev*2010, 37(4):74-78. 10.1145/1773394.1773407View ArticleGoogle Scholar - Wolkerstorfer M, Nordström T:
*Coverage optimization in DSL networks by low-complexity discrete spectrum balancing*. Houston, Texas, USA; 2011.View ArticleGoogle Scholar - Brehmer J, Utschick W: Nonconcave utility maximisation in the MIMO broadcast channel.
*EURASIP J. Adv. Signal Process*2009, 1-13. Article ID 645041Google Scholar - Xu Y, Le-Ngoc T, Panigrahi S: Global concave minimization for optimal spectrum balancing in multi-user DSL networks.
*IEEE Trans. Signal Process*2008, 56(7):2875-2885.MathSciNetView ArticleGoogle Scholar - Eriksson K, Shi S, Vucic N, Schubert M, Larsson E: Globally optimal resource allocation for achieving maximum weighted sum rate. In
*IEEE Global Telecommunications Conference (GLOBECOM’10)*. USA, Miami; 2010.Google Scholar - Charafeddine M, Paulraj A: Sequential geometric programming for 2×2 interference channel power control. In
*Conference on Information Sciences and Systems (CISS’07)*. Baltimore, MD, USA; 2007.Google Scholar - Horst R, Pardalos P:
*Handbook of Global Optimization, Volume 2 of Nonconvex Optimization and its Applications*. Kluwer Academic Publishers, Dordrecht; 1995.MATHGoogle Scholar - ITU-T: Asymmetric digital subscriber line (ADSL) transceivers - Extended bandwidth ADSL2 (ADSL2+).
*G.992.5*2005.Google Scholar - ETSI: Transmission and Multiplexing (TM); Access transmission systems on metallic access cables; Very high speed Digital Subscriber Line (VDSL); Part 1 Functional requirements.
*TM6 TS 101 270-1, Version 1.3.1*2003.Google Scholar - Statovci D, Nordström T: Adaptive resource allocation in multiuser FDD-DMT systems. In
*European Signal Processing Conference 2004 (Eusipco’04)*. Vienna, Austria; 2004.Google Scholar - Cioffi J, Zou H, Chowdhery A, Lee W, Jagannathan S: Greener copper with dynamic spectrum management. In
*IEEE Global Telecommunications Conference 2008 (GLOBECOM)*. New Orleans, LA, USA; 2008.Google Scholar - ITU-T: Very high speed digital subscriber line transceivers 2 (VDSL2).
*G.993.2*2006.Google Scholar - van der Zee R: High Efficiency Audio Power Amplifiers Design and practical use.
*PhD thesis, Twente University*1999.Google Scholar - Boyd S, Vandenberghe L:
*Convex Optimization*. Cambridge University Press, Cambridge; 2004.View ArticleMATHGoogle Scholar - Yates R: A framework for uplink power control in cellular radio systems.
*IEEE J. Sel. Areas Commun*1995, 13(7):1341-1347. 10.1109/49.414651MathSciNetView ArticleGoogle Scholar - Mosek ApS:
*The MOSEK optimization toolbox for MATLAB manual*. Version 6.0 (Rev 106), Copenhagen, Denmark, (2011)Google Scholar - Horst R, Thoai N: DC Programming: Overview.
*J. Optimiz. Theory Appl*1999, 103: 1-43. 10.1023/A:1021765131316MathSciNetView ArticleMATHGoogle Scholar - Ryoo H, Sahinidis N: A branch-and-reduce approach to global optimization.
*J. Global Optimiz*1996, 8(2):107-138. 10.1007/BF00138689MathSciNetView ArticleMATHGoogle Scholar - Sahinidis N:
*BARON - Branch and Reduce Optimization Navigator*. Version 4.0, University of Illinois at Urbana-Champaign (2000)Google Scholar - Cambini R, Salvi F: A branch and reduce approach for solving a class of low rank d.c. programs.
*J. Comput. Appl. Math*2009, 233: 492-501. 10.1016/j.cam.2009.07.053MathSciNetView ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.