# Patent

## Title
Power control method for remotely deployed communication service

## Abstract

A power control method for transceiver units conveying data over discrete tones. The method includes the steps of: determining a transmit power over a physical channel for each individual tone, such that this transmit power maximizes a weighted function of data rates achievable with this tone over the physical channel and over modeled neighboring channels, with the constraint that this transmit power conforms to a transmit power mask, summing up the data rates over the whole set of tones, adjusting the weights such that the total data rates over the modeled neighboring channels reach some target data rates, and such that the total data rate over the physical channel is maximized, with the constraint that each weight is identical over the whole set of tones.

## Background
BACKGROUND OF THE INVENTION
The present invention relates to a method for determining at least one operational transmit power over a physical channel for respective ones of at least one tone.
Such a method is already known in the art, e.g. from the article entitled “Distributed Multi-user Power Control for Digital Subscriber Lines”, from Wei YU, Georges GINIS and John M. CIOFFI, published in the IEEE Journal of Selected Areas in Communications (J-SAC) of June 2002.
Spectrum management and power control are central issues in the design of interference-limited multi-user digital communication systems, such as Digital Subscriber Line (DSL) systems.
As the demand for higher data rates increases, spectrum management and power control emerge as central issues for the following two reasons: first, high-speed DSL systems are evolving toward higher frequency bands, where the crosstalk problem is more pronounced. Second, remotely deployed DSL can potentially emit strong crosstalk into neighboring lines.
FIG. 1 illustrates the latter issue. 3 transceiver unit pairs RT1/CP1, CO1/CP2 and CO2/CP3 are connected via twisted pairs L1, L2 and L3 respectively. The twisted pairs L1, L2 and L3 are bundled together in the binder B on the way to the central office CO. Because of their close proximity, the lines create electromagnetic interference into each other. Near-end crosstalk (NEXT) refers to crosstalk created by transmitters located on the same side as the receiver. Far-end crosstalk (FEXT) refers to crosstalk created by transmitters located on the other side. NEXT is usually much stronger than FEXT. To avoid NEXT, DSL makes use of frequency division multiplexing, wherein upstream (from customer premises) and downstream (to customer premises) signals are assigned distinct frequency bands.
In order to shorten the loop length with the purpose of increasing the data rate, the transceiver unit RT1 is deployed closer to the customer premises CP1, e.g. by means of an optical fiber OF. This is referred to as remotely or RT deployed DSL, as opposed to centrally or CO deployed DSL.
The signal from the transceiver unit CO1 is attenuated to a certain extent when it starts coupling with the line L1 in the binder B, thereby creating a weak FEXT F12. On the contrary, the signal from the transceiver unit RT1 is much stronger when it starts coupling with the line L2, thereby creating a stronger FEXT F21.
Several power control methods have been proposed in the Literature.
The cited document discloses a power control method, wherein each transceiver unit allocates power by waterfilling against the background noise and interference from other transceiver units. The power allocation of one transceiver unit affects the interference seen by other transceiver units. This in turn affects their power allocation so there is a coupling between the power allocation of the different users. Iterative waterfilling employs an iterative procedure whereby each transceiver unit waterfills in turn until a convergence point is reached.
The disclosed power control method is a realization of dynamic spectrum management. It adapts to suit the direct and crosstalk channels seen by the transceiver units in each specific deployment. The result is a much less conservative design hence higher performance.
Yet, the disclosed power control method leads to transmit Power Spectral Density (PSD) which may exceed the spectral masks defined in DSL standards. Hence, it does not satisfy spectral compatibility rules under method A. Instead, it relies on method B tests to ensure compatibility. These tests are highly complex. Furthermore, it is unclear whether spectral compatibility of iterative waterfilling under method B can be guaranteed for all deployment scenarios.
An other deficiency of the disclosed power control method is that it essentially implements flat Power Back-Off (PBO) over short loops, such as those seen on RT deployed DSL. In this scenario, it inherits all of the problems associated with flat PBO.
SUMMARY OF THE INVENTION
It is an object of the present invention to palliate those deficiencies.
According to the invention, this object is achieved due to the fact that said method comprises the steps of

    
    
        determining a transmit power over said physical channel for each individual tone of said at least one tone such that said transmit power maximizes a weighted function of a data rate achievable over said physical channel and over said individual tone, and at least one concurrent data rate achievable over respective ones of at least one modeled neighboring channel and over said individual tone, with the constraint that said transmit power conforms to a transmit power mask,
        determining therefrom a total data rate achievable over said physical channel and over said at least one tone, and at least one total concurrent data rate achievable over respective ones of said at least one modeled neighboring channel and over said at least one tone,
        adjusting each weight of said weighted function such that said at least one total concurrent data rate is greater than or equal to respective ones of at least one target data rate, and such that said total data rate is maximized, with the constraint that each weight of said weighted function is identical over said at least one tone, thereby determining by iteration said at least one operational transmit power.
    
    


Normally, the power allocation problem is non-convex. This results in a numerically intractable problem which cannot be solved, or cannot be solved with reasonable processing capabilities.
However, the following simplifications leads to a nearly optimal PBO solution:

    
    
        Each tone of said at least one tone is considered separately in the optimization process.
        The transmitted signal must conform to a transmit power mask.
        Each weight of said weighted function is identical over said at least one tone.
    
    


Since the solution lies within a spectral mask, there is no issue of spectral compatibility.
This technique is amenable to autonomous implementation through the definition of a protected service (worst case-victim), which will typically be a CO deployed DSL. Yet, power allocation is still based on the channel as seen on the RT deployed DSL. As a result, the solution is not overly conservative.
Varying the desired rate for the protected service allows different tradeoffs to be achieved between reach of CO deployed DSLs and data rates of RT deployed DSLs. This trade-off can be varied to suit each geographical region. Hence, the carrier can offer the most profitable service portfolio based on the demography of customers within an area.
This technique has application for RT deployed Asymmetric DSL (ADSL) and RT deployed Very high speed asymmetric DSL (VDSL), when legacy ADSL systems must be protected. This technique achieves significant gains over traditional static spectrum management, where RT deployed VDSL is prohibited from transmitting in the ADSL band.
This technique has also application for upstream VDSL transmitters, where signal from far-end transmitters must be protected from the large crosstalk caused by near-end transmitters.
The result is a simple, autonomous PBO method applicable interalia to CO and RT deployed DSL.
The present invention also relates to a transceiver unit comprising:

    
    
        a transmitter unit adapted to transmit at least one tone over a physical channel,
        a power control unit coupled to said transmitter unit, and adapted to determine at least one operational transmit power over said physical channel for respective ones of said at least one tone.
    
    


By implementing the present power control method in said power control unit, similar objectives are achieved.
The present invention also relates to a digital communication system comprising:

    
    
        at least one transceiver unit,
        a communication adaptation module coupled to said at least one transceiver unit via a data communication network, each of said at least one transceiver unit comprising:
        a transmitter unit adapted to transmit at least one tone over a physical channel, said communication adaptation module comprising:
        a power control unit adapted to determine at least one operational transmit power over said physical channel for respective ones of said at least one tone.
    
    


By implementing the present power control method in said power control unit, similar objectives are achieved.
With this embodiment, the transceiver units are released from the burden of computing the transmit powers and processing resources saving is achieved, yet at the expense of the network resources required for centralizing the necessary information from the local entities, and of their operational autonomy.
Said data communication network stands for whatever type of network adapted to convey data between any of its ports, being a Local Area Network (LAN) such as an Ethernet bus, a Wide Area Network (WAN) such as an ATM broadband network or the Internet, etc, and irrespective of the underlying communication technology being used, being circuit-switched or packet-switched communication, being wired or wireless communication, etc.
The scope of the present invention is not limited to DSL communication systems. The present invention is applicable to whatever type of digital communication system conveying data over discrete tones, being by means of Discrete Multi-Tones (DMT) modulation, Single Carrier modulation, Code Division Multiple Access (CDMA) modulation, etc, and to whatever type of physical transmission medium, being coaxial cables, optical fibers, the atmosphere, the empty space, etc, wherein the crosstalk is a potential source of noise, not necessarily the predominant one.
Another characterizing embodiment of the present invention is that the determination of said transmit power is restricted to a pre-determined discrete set of data rates as enforced by a coding and/or modulation scheme used over said physical channel.
This simplification allows a solution to be found with lower complexity.
Another characterizing embodiment of the present invention is that said weighted function is a weighted sum.
Other mathematical functions with a weight operation, with said data rate and said at least one concurrent data rate as input, possibly with another optimization objective, can be thought of.
Further characterizing embodiments of the present invention are mentioned in the appended claims.
It is to be noticed that the term ‘comprising’, also used in the claims, should not be interpreted as being restricted to the means listed thereafter. Thus, the scope of the expression ‘a device comprising means A and B’ should not be limited to devices consisting only of components A and B. It means that with respect to the present invention, the relevant components of the device are A and B.
Similarly, it is to be noticed that the term ‘coupled’, also used in the claims, should not be interpreted as being restricted to direct connections only. Thus, the scope of the expression ‘a device A coupled to a device B’ should not be limited to devices or systems wherein an output of device A is directly connected to an input of device B. It means that there exists a path between an output of A and an input of B which may be a path including other devices or means.



BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects and features of the invention will become more apparent and the invention itself will be best understood by referring to the following description of an embodiment taken in conjunction with the accompanying drawings wherein:
FIG. 1 represents a remotely deployed DSL system
FIG. 2 represents a interference channel model,
FIG. 3 represents a DSL transceiver unit according to the present invention,
FIG. 4 represents the rate regions of different PBO methods, including the proposed scheme,
FIG. 5 represents a DSL communication system according to the present invention.



DETAILED DESCRIPTION OF THE INVENTION
Consider the interference channel model depicted in FIG. 2. There are N neighboring channels C1 to CN connecting respective ones of N transmitters X1 to XN to respective ones of N receivers Y1 to YN.
Denote the direct channel transfer function from the transmitter Xn to the receiver Yn as Hnn. Denote the crosstalk channel transfer function from the transmitter Xm to the receiver Yn as Hnm (m≠n).
In addition to the interference, each receiver also experiences zero-mean Additive White Gaussian Noise (AWGN), the PSD of which is denoted as σn2.
Denote the PSD of each transmitted signal as Sn.
The achievable data rate Rn over the channel Cn (while treating all interference as noise) is given by the Shannon Formula:




  
    
      
        
          R
          n
        
        =
        
          
            ∫
            0
            
              F
              max
            
          
          ⁢
          
            
              
                log
                2
              
              (
              
                1
                +
                
                  
                    
                      
                        S
                        n
                      
                      ⁡
                      
                        (
                        f
                        )
                      
                    
                    ·
                    
                      
                        
                        
                          
                            H
                            nn
                          
                          ⁡
                          
                            (
                            f
                            )
                          
                        
                        
                      
                      2
                    
                  
                  
                    Γ
                    ⁡
                    
                      (
                      
                        
                          
                            σ
                            n
                            2
                          
                          ⁡
                          
                            (
                            f
                            )
                          
                        
                        +
                        
                          
                            ∑
                            
                              m
                              ≠
                              n
                            
                          
                          ⁢
                          
                            
                              
                                S
                                m
                              
                              ⁡
                              
                                (
                                f
                                )
                              
                            
                            ·
                            
                              
                                
                                
                                  
                                    H
                                    nm
                                  
                                  ⁡
                                  
                                    (
                                    f
                                    )
                                  
                                
                                
                              
                              2
                            
                          
                        
                      
                      )
                    
                  
                
              
              )
            
            ⁢
            
              d
              f
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where the SNR-gap is denoted as Γ. The SNR-gap Γ defines the gap between a practical coding and modulation scheme and the channel capacity. The SNR-gap Γ depends on the coding and modulation scheme being used, and also on the target probability of error. At theoretical capacity, Γ=0 dB.

In one embodiment of the present invention, the signal is sampled at a sampling frequency Fs, which is at least twice the signal bandwidth. The signal is captured over a time window Tc that matches one DMT symbol, i.e. the frequency spacing 1/Tc matches the tone spacing.
The achievable data rate Rn is then given by:




  
    
      
        
          R
          n
        
        =
        
          
            ∑
            
              k
              =
              1
            
            K
          
          ⁢
          
            
              
                log
                2
              
              (
              
                1
                +
                
                  
                    
                      S
                      
                        n
                        ,
                        k
                      
                    
                    ·
                    
                      
                        
                        
                          H
                          
                            nn
                            ,
                            k
                          
                        
                        
                      
                      2
                    
                  
                  
                    Γ
                    ⁡
                    
                      (
                      
                        
                          σ
                          
                            n
                            ,
                            k
                          
                          2
                        
                        +
                        
                          
                            ∑
                            
                              m
                              ≠
                              n
                            
                          
                          ⁢
                          
                            
                              S
                              
                                m
                                ,
                                k
                              
                            
                            ·
                            
                              
                                
                                
                                  H
                                  
                                    nm
                                    ,
                                    k
                                  
                                
                                
                              
                              2
                            
                          
                        
                      
                      )
                    
                  
                
              
              )
            
            ⁢
            
              
            
            ⁢
            
              1
              
                T
                c
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




where:

    
    
        the set of tones over which the present optimization process is conducted is denoted as {f1, . . . , fK), f1 to fK being harmonic frequencies of the fundamental frequency 1/Tc,
        Sn,k=Sn(fk),
        Hnm,k=Hnm(fk),
        σn,k2=σn2(fk).
    
    


In one embodiment of the present invention, {f1, . . . , fK) is defined by the applicable DSL standard.
In another embodiment, {f1, . . . , fK) is a subset thereof.
Denote the number of bits a particular tone fk can be loaded with over the channel Cn as Bn,k.
We have:




  
    
      
        
          B
          
            n
            ,
            k
          
        
        =
        
          ⌊
          
            
              log
              2
            
            (
            
              1
              +
              
                
                  
                    S
                    
                      n
                      ,
                      k
                    
                  
                  ·
                  
                    
                      
                      
                        H
                        
                          nn
                          ,
                          k
                        
                      
                      
                    
                    2
                  
                
                
                  Γ
                  ⁡
                  
                    (
                    
                      
                        σ
                        
                          n
                          ,
                          k
                        
                        2
                      
                      +
                      
                        
                          ∑
                          
                            m
                            ≠
                            n
                          
                        
                        ⁢
                        
                          
                            S
                            
                              m
                              ,
                              k
                            
                          
                          ·
                          
                            
                              
                              
                                H
                                
                                  nm
                                  ,
                                  k
                                
                              
                              
                            
                            2
                          
                        
                      
                    
                    )
                  
                
              
            
            )
          
          ⌋
        
      
    
    
      
        (
        3
        )
      
    
  




where └x┘ rounds down to the nearest value in the set {b0=0, b1, . . . , bL}. The set {b0, b1, . . . , bL} is the set of all possible bit loading values as defined by the applicable DMT modulation scheme.

FIG. 3 depicts a DSL transceiver unit RT1 adapted to transmit a DMT modulated signal over a twisted pair L1.
With respect to the present invention, the transceiver unit RT1 comprises the following functional blocks:

    
    
        a power control unit PC,
        a transmitter unit TX,
        a receiver unit RX,
        a hybrid circuit H,
        a line adaptator T.
    
    


The power control unit PC is coupled to both the transmitter unit TX and the receiver unit RX. The transmitter unit TX and the receiver unit RX are both coupled to the hybrid circuit H. The hybrid circuit H is coupled to the line adaptator T.
The transmitter unit TX accommodates the necessary means for encoding user and control data and for modulating DSL tones with the so encoded data. The transmitter unit accommodates the necessary means for controlling the transmit power of each tone, as determined by the power control unit PC.
The receiver unit RX accommodates the necessary means for demodulating a DSL signal and for decoding user and control data from the so-demodulated signal.
The hybrid circuit H is adapted to couple the transmitter unit TX′ output to the twisted pair L1, and the twisted pair L1 to the receiver unit RX's input. The hybrid circuit H accommodates an echo cancellation means to avoid the transmitted unit TX's signal to couple into the receiver unit RX's input.
The line adaptator T is adapted to isolate the transceiver unit RT1 from the twisted pair L1, and to adapt the input and output impedance of the transceiver unit RT1 to the line characteristic impedance.
The power control unit PC is adapted to determine by iteration the operational transmit powers of the DSL tones.
The power control unit PC comprises the following functional blocks:

    
    
        a first agent A1,
        a second agent A2,
        a third agent A3.
    
    


The first agent A1 is coupled to the second agent A2, to the transmitter unit TX and to the receiver unit RX. The second agent A2 is coupled to the third agent A3. The third agent A3 is coupled to the first agent A1.
The first agent makes use of the foregoing interference channel model, wherein the channel C1 stands for the line L1. The first agent A1 assumes then N−1 neighboring channels C2 to CN interfering with the line L1.
Denote a particular bit loading out of the set {b0, b1, . . . , bL) as bl.
Denote a particular tone as fk.
Denote the transmit power required to load the tone fk with bl bits over the line L1 as S1,k,l.
We can write from the equation (3):




  
    
      
        
          s
          
            1
            ,
            k
            ,
            l
          
        
        =
        
          
            
              
                σ
                
                  1
                  ,
                  k
                
                2
              
              +
              
                
                  ∑
                  
                    m
                    ≠
                    1
                  
                
                ⁢
                
                  
                    S
                    
                      m
                      ,
                      k
                    
                  
                  ·
                  
                    
                      
                      
                        H
                        
                          
                            1
                            ⁢
                            m
                          
                          ,
                          k
                        
                      
                      
                    
                    2
                  
                
              
            
            
              
                
                
                  H
                  
                    11
                    ,
                    k
                  
                
                
              
              2
            
          
          ⁢
          
            (
            
              
                2
                
                  b
                  1
                
              
              -
              1
            
            )
          
          ⁢
          Γ
        
      
    
    
      
        (
        4
        )
      
    
  




The peer transceiver unit at the other end of the line L1, presently CP1, determines some channel information from measurements performed on the received signal and noise.
In one embodiment of the present invention, the first agent A1 makes uses of the transmit power and the corresponding bit loading as computed by the peer transceiver unit for the tone fk, denoted as SR1,k and BR1,k respectively.
The receiver unit RX is adapted to forward those pieces of information, denoted as IR in FIG. 3, to the first agent A1.
We have:




  
    
      
        
          
            
              
                σ
                
                  1
                  ,
                  k
                
                2
              
              +
              
                
                  ∑
                  
                    m
                    ≠
                    1
                  
                
                ⁢
                
                  
                    S
                    
                      m
                      ,
                      k
                    
                  
                  ·
                  
                    
                      
                      
                        H
                        
                          
                            1
                            ⁢
                            m
                          
                          ,
                          k
                        
                      
                      
                    
                    2
                  
                
              
            
            
              
                
                
                  H
                  
                    11
                    ,
                    k
                  
                
                
              
              2
            
          
          =
          
            
              1
              
                
                  (
                  
                    
                      2
                      
                        BR
                        
                          1
                          ,
                          k
                        
                      
                    
                    -
                    1
                  
                  )
                
                ⁢
                Γ
              
            
            ⁢
            
              SR
              
                1
                ,
                k
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          and:
        
        ⁢
        
          

        
        ⁢
        
          
            s
            
              1
              ,
              k
              ,
              l
            
          
          =
          
            
              
                (
                
                  
                    2
                    
                      b
                      1
                    
                  
                  -
                  1
                
                )
              
              
                (
                
                  
                    2
                    
                      BR
                      
                        1
                        ,
                        k
                      
                    
                  
                  -
                  1
                
                )
              
            
            ⁢
            
              SR
              
                1
                ,
                k
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




In another embodiment, the first agent A1 makes use of the noise and the direct channel transfer function as measured by the peer transceiver unit.
In still another embodiment, the first agent A1 makes use of the Channel Signal to Noise Ratio (C-SNR) as measured by the peer transceiver unit




  
    (
    
      
        CSNR
        
          1
          ,
          k
        
      
      =
      
        
          
            
            
              H
              
                11
                ,
                k
              
            
            
          
          2
        
        
          
            σ
            
              1
              ,
              k
            
            2
          
          +
          
            
              ∑
              
                m
                ≠
                1
              
            
            ⁢
            
              
                S
                
                  m
                  ,
                  k
                
              
              ·
              
                
                  
                  
                    H
                    
                      
                        1
                        ⁢
                        m
                      
                      ,
                      k
                    
                  
                  
                
                2
              
            
          
        
      
    
    )
  
  .




The first agent A1 determines S1,k,l for all the bit loading b1 to bL (S1,k,o=0 dB) by means of the equation (5).
A bit loading bl for which the corresponding transmit power S1,k,l does not conform to some pre-determined transmit power mask is discarded.
Next, the first agent A1 determines for each S1,k,l the bit loading achievable over the neighboring channels C2 to CN, denoted as B2,k,l to BN,k,l respectively.
The first agent A1 makes use of some level of knowledge regarding the neighboring systems and the transmission environment.
The following data are assumed to be preliminarily known:

    
    
        N−1 transmit PSD S2 to SN for the transmitters X2 to XN respectively
        N−1 noise PSD σ22 to σN2 for the channels C2 to CN respectively,
        N−1 direct transfer function magnitudes |H22| to |HNN| for the channels C2 to CN respectively,
        N−1 crosstalk transfer function magnitudes |H21| to |HN1| from the transmitter X1 to the receivers Y2 to YN respectively.
    
    


In one embodiment of the present invention, those data are held in a non-volatile storage area.
In another embodiment, the transceiver unit RT1 further comprises communication means adapted to retrieve all or part of those data from a remote server.
In one embodiment of the present invention, the first agent A1 makes use of a crosstalk channel model, wherein the transfer function magnitude |Hm1| for the tone fk is given by:

|Hm1,k|2=Km·fk2·lB·(e−αm,k·m)2(2≦m≦N)  (6)

where:

    
    
        Km is a coupling constant between the line L1 and the channel Cm,
        the theoretical length over which the line L1 is bundled together with the channels C2 to CN is denoted as lB,
        the theoretical signal attenuation of the tone fk over the channel Cm is denoted as αm,k,
        the theoretical length of the channel through which the crosstalk signal from the transmitter X1 into the receiver Ym attenuates is denoted as lm.
    
    


The bit loading B2,k,l to BN,k,l achievable over the neighboring channels C2 to CN for a given S1,k,l are obtained by means of the following equation:




  
    
      
        
          B
          
            m
            ,
            k
            ,
            l
          
        
        =
        
          
            ⌊
            
              
                log
                2
              
              ⁡
              
                (
                
                  1
                  +
                  
                    
                      
                        S
                        
                          m
                          ,
                          k
                        
                      
                      ·
                      
                        
                          
                          
                            H
                            
                              mm
                              ,
                              k
                            
                          
                          
                        
                        2
                      
                    
                    
                      Γ
                      ⁡
                      
                        (
                        
                          
                            σ
                            
                              m
                              ,
                              k
                            
                            2
                          
                          +
                          
                            
                              S
                              
                                1
                                ,
                                k
                                ,
                                l
                              
                            
                            ·
                            
                              
                                
                                
                                  H
                                  
                                    m1
                                    ,
                                    k
                                  
                                
                                
                              
                              2
                            
                          
                        
                        )
                      
                    
                  
                
                )
              
            
            ⌋
          
          ⁢
          
            
          
          ⁢
          
            (
            
              2
              ≤
              m
              ≤
              N
            
            )
          
        
      
    
    
      
        (
        7
        )
      
    
  




combined with the equation (6)

The interference between the channels C2 to CN are assumed to be included in the noise model σm2.
In another embodiment, the first agent A1 makes use of another crosstalk channel model as known to a person skilled in the art.
The first agent A1 computes a weighted sum of the bit loading achievable over the line L1 and the bit loading achievable over the channels C2 to CN:




  
    
      
        
          J
          
            k
            ,
            l
          
        
        =
        
          
            
              w
              1
            
            ·
            
              b
              l
            
          
          +
          
            
              ∑
              
                m
                =
                2
              
              N
            
            ⁢
            
              
                w
                m
              
              ·
              
                B
                
                  m
                  ,
                  k
                  ,
                  l
                
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




The first agent A1 determines the bit loading blk that maximizes the weighted sum Jk,l:

lk=argmaxl(Jk,l)  (9)

The transmit power of the tone fk over the line L1 that maximizes the weighted sum Jk,l is then given by:




  
    
      
        
          S
          
            1
            ,
            k
          
        
        =
        
          
            S
            
              1
              ,
              k
              ,
              
                l
                k
              
            
          
          =
          
            
              
                (
                
                  
                    2
                    
                      b
                      
                        l
                        k
                      
                    
                  
                  -
                  1
                
                )
              
              
                (
                
                  
                    2
                    
                      bR
                      
                        1
                        ,
                        k
                      
                    
                  
                  -
                  1
                
                )
              
            
            ⁢
            
              SR
              
                1
                ,
                k
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




The corresponding bit loading over the line L1 is given by:

B1,k=blk  (11)

The corresponding bit loading over the channels C2 to CN is given by:




  
    
      
        
          B
          
            m
            ,
            k
          
        
        =
        
          
            B
            
              m
              ,
              k
              ,
              
                l
                k
              
            
          
          =
          
            
              ⌊
              
                
                  log
                  2
                
                (
                
                  1
                  +
                  
                    
                      
                        S
                        
                          m
                          ,
                          k
                        
                      
                      ·
                      
                        
                          
                          
                            H
                            
                              mm
                              ,
                              k
                            
                          
                          
                        
                        2
                      
                    
                    
                      Γ
                      ⁡
                      
                        (
                        
                          
                            σ
                            
                              m
                              ,
                              k
                            
                            2
                          
                          +
                          
                            
                              S
                              
                                1
                                ,
                                k
                                ,
                                
                                  l
                                  k
                                
                              
                            
                            ·
                            
                              
                                
                                
                                  H
                                  
                                    m1
                                    ,
                                    k
                                  
                                
                                
                              
                              2
                            
                          
                        
                        )
                      
                    
                  
                
                )
              
              ⌋
            
            ⁢
            
              
            
            ⁢
            
              (
              
                2
                ≤
                m
                ≤
                N
              
              )
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




The first agent A1 re-iterates the procedure for all the tones f1 to fK.
The first agent A1 makes B1,k to BN,k available to the second agent A2 for all the tones f1 to fK, e.g. by means of a share memory area and one or more software trigger.
The second agent A2 sums up B1,k over all the tones f1 to fK, thereby determining a total bit loading B1:




  
    
      
        
          B
          1
        
        =
        
          
            ∑
            
              k
              =
              1
            
            K
          
          ⁢
          
            B
            
              1
              ,
              k
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




The second agent A2 sums up B2,k to BN,k over all the tones f1 to fK, thereby determining N−1 total concurrent bit loading B2 to BN:




  
    
      
        
          
            
              
                B
                m
              
              =
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  K
                
                ⁢
                
                  B
                  
                    m
                    ,
                    k
                  
                
              
            
          
          
            
              
            
          
          
            
              (
              
                2
                ≤
                m
                ≤
                N
              
              )
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




The third agent A3 adapts the weight w1 to wN such that B2 to BN are respectively greater than or equal to target rates BT2 to BTN, and such that B1 is maximized.
In one embodiment of the present invention:




  
    w
    1
  
  =
  
    1
    -
    
      
        ∑
        
          m
          =
          2
        
        N
      
      ⁢
      
        w
        m
      
    
  




If any of the total concurrent bit rate B2 to BN is lower than its target rate then the corresponding weight is increased by dichotomy. If any of the total concurrent bit rate B2 to BN is greater than its target rate then the corresponding weight is decreased by dichotomy.
In another embodiment, the third agent A3 adjust the weights w1 to wN by means of another algorithm as known to a person skilled in the art.
The new weight values are made available to the first agent A1, which in turn determines new transmit powers therefrom, and so on.
The process keeps on until a convergence criteria is met, e.g. the interval wherein each weight is presently assumed to be is less than a pre-determined threshold ε.
The third agent A3 notifies the first agent A1 of the process completion. Thereupon, the first agent A1 makes the lastly determined S1,k available to the transmitter unit TX for all the tones f1 to fK.
The transmitter unit TX applies the transmit power S1,1 to S1,K to the tones f1 to fK respectively.
It would be apparent to a person skilled in the art that bit loading or bit rate could have been be used interchangeably (actually, the bit loading is the number of bits a tone conveys over a DMT symbol period).
FIG. 4 represents the rate regions of different PBO methods, including the proposed scheme. In this numerical analysis, PBO is assumed to be applied to a RT deployed ADSL interfering with a CO deployed ADSL. The proposed scheme achieves significant performance gains over existing methods: with 1 Mbps as target data rate on the CO deployed ADSL, the RT deployed ADSL achieves 1,7 Mbps with flat PBO, 2,4 Mbps with reference noise, 3,7 Mbps with iterative waterfilling and 6,7 Mbps with the proposed scheme.
Another characterizing embodiment of the present invention is depicted in FIG. 5.
With respect to the present invention, the DSL communication system S comprises the following functional blocks:

    
    
        a communication adaptation module CAM,
        a transceiver unit RT2,
        a data communication network DCN.
    
    


The communication adaptation module CAM is coupled to the transceiver unit RT2 via the data communication network DCN.
With respect to the present invention, the communication adaptation module CAM comprises the following functional blocks:

    
    
        the previously described power control unit PC, which comprises the previously described agents A1 to A3,
        a communication means COM1,
        an input/output port I/O1.
    
    


The first agent A1 is coupled to the second agent A2 and to the communication means COM1. The second agent A2 is coupled to the third agent A3. The third agent A3 is coupled to the first agent A1. The communication means COM1 is coupled to the input/output port I/O1.
The input/output port I/O1 accommodates the necessary means for encoding and transmitting data over the data communication network DCN, and for receiving and decoding data from the data communication network DCN.
The communication means COM1 accommodates the necessary means for communicating via the data communication network DCN with a transceiver unit, and for checking the integrity of the messages exchanged over the data communication network DCN.
More specifically, the communication means COM1 is adapted to receive from a transceiver unit the channel information IR necessary for computing the operational transmit powers of this transceiver unit, and to forward them to the first agent A1.
The communication means COM1 is further adapted to send to a transceiver unit the operational transmit powers S1,1 to S1,K as determined by the power control unit PC for this transceiver unit.
With respect to the present invention, the transceiver unit RT2 comprises the following functional blocks:

    
    
        the previously described transmitter unit TX,
        the previously described receiver unit RX,
        the previously described hybrid circuit H,
        the previously described line adaptator T,
        a communication means COM2,
        an input/output port I/O2.
    
    


The transmitter unit TX and the receiver unit RX are both coupled to the hybrid circuit H. The hybrid circuit H is coupled to the line adaptator T. The communication means COM2 is coupled to the transmitter unit TX, to the receiver unit RX and to the input/output port I/O2.
The input/output port I/O2 accommodates the necessary means for encoding and transmitting data over the data communication network DCN, and for receiving and decoding data from the data communication network DCN.
The communication means COM2 accommodates the necessary means for communicating via the data communication network DCN with a communication adaptation module, and for checking the integrity of the messages exchanged over the data communication network DCN.
More specifically, the communication means COM2 is adapted to forward the necessary channel information IR, as reported by a peer transceiver unit, to a communication adaptation module for further processing.
The communication means COM2 is further adapted to receive from a communication adaptation module the operational transmit powers S1,1 to S1,K, and to forward them to the transmitter unit TX.
In one embodiment of the present invention, the communication adaptation module CAM is housed by a network manager, and is coupled to the transceiver units via a WAN, such as an ATM network.
In another embodiment, the communication adaptation module CAM is mounted on a card and plugged into a card slot of a Digital Subscriber Line Access Multiplexer (DSLAM). The communication adaptation module CAM is coupled to the DSLAM's transceiver units via a local bus, such as an Ethernet bus, and to the remotely deployed transceiver units via their respective link to the DSLAM.
A final remark is that embodiments of the present invention are described above in terms of functional blocks. From the functional description of these blocks, given above, it will be apparent for a person skilled in the art of designing electronic devices how embodiments of these blocks can be manufactured with well-known electronic components. A detailed architecture of the contents of the functional blocks hence is not given.
While the principles of the invention have been described above in connection with specific apparatus, it is to be clearly understood that this description is made only by way of example and not as a limitation on the scope of the invention, as defined in the appended claims.

## Claims

1. A method for determining at least one operational transmit power (S1,1 to S1,K) over a physical channel (L1) for respective ones of at least one tone (f1 to fK),
characterized in that said method comprises the steps of:
determining a transmit power over said physical channel for each individual tone of said at least one tone such that said transmit power maximizes a weighted function of a data rate achievable over said physical channel and over said individual tone, and at least one concurrent data rate achievable over respective ones of at least one modeled neighboring channel (C2 to CN) and over said individual tone, with the constraint that said transmit power conforms to a transmit power mask,
determining from the determined transmit power a total data rate (B1) achievable over said physical channel and over said at least one tone, and at least one total concurrent data rate (B2 to BN) achievable over respective ones of said at least one modeled neighboring channel and over said at least one tone,
adjusting each weight (w1 to wN) of said weighted function such that said at least one total concurrent data rate is greater than or equal to respective ones of at least one target data rate (BT2 to BTN), and such that said total data rate is maximized, with the constraint that each weight of said weighted function is identical over said at least one tone,
thereby determining by iteration said at least one operational transmit power.

2. A method according to claim 1, characterized in that the step of determining said transmit power is restricted to a pre-determined discrete set of data rates as enforced by a coding and/or modulation scheme used over said channel.

3. A method according to claim 1, characterized in that said weighted function is a weighted sum.

4. A transceiver unit (RT1) comprising:
a transmitter unit (TX) adapted to transmit at least one tone (f1 to fK) over a physical channel (L1),
a power control unit (PC) coupled to said transmitter unit, and adapted to determine at least one operational transmit power (S1,1 to S1,K) over said physical channel for respective ones of said at least one tone,
characterized in that said power control unit comprises:
a first agent (A1) adapted to determine a transmit power over said physical channel for each individual tone of said at least one tone such that said transmit power maximizes a weighted function of a data rate achievable over said physical channel and over said individual tone, and at least one concurrent data rate achievable over respective ones of at least one modeled neighboring channel (C2 to CN) and over said individual tone, with the constraint that said transmit power conforms to a transmit power mask,
a second agent (A2) coupled to said first agent, and adapted to determine therefrom a total data rate (B1) achievable over said physical channel and over said at least one tone, and at least one total concurrent data rate (B2 to BN) achievable over respective ones of said at least one modeled neighboring channel and over said at least one tone,
a third agent (A3) coupled to said first agent and to said second agent, and adapted to adjust each weight (W1 to WN) of said weighted function such that said at least one total concurrent data rate is greater than or equal to respective ones of at least one target data rate (BT2 to BTn), and such that said total data rate is maximized, with the constraint that each weight of said weighted function is identical over said at least one tone,
thereby determining by iteration said at least one operational transmit power.

5. A transceiver unit according to claim 4, characterized in that said first agent is further adapted to restrict determination of said transmit power to a pre-determined discrete set of data rates as enforced by a coding and/or modulation scheme used over said channel.

6. A transceiver unit according to claim 4, characterized in that said weighted function is a weighted sum.

7. A transceiver unit according to claim 4, characterized in that said transceiver unit is a digital subscriber line (xDSL) transceiver unit.

8. A digital communication system (S) comprising:
at least one transceiver unit (RT2),
a communication adaptation module (CAM) coupled to said at least one transceiver unit via a data communication network,
each of said at least one transceiver unit comprising:
a transmitter unit (TX) adapted to transmit at least one tone (f1 to fK) over a physical channel (L1),
said communication adaptation module comprising:
a power control unit (PC) adapted to determine at least one operational transmit power (S1,1 to S1,K) over said physical channel for respective ones of said at least one tone,
characterized in that said power control unit comprises:
a first agent (A1) adapted to determine a transmit power over said physical channel for each individual tone of said at least one tone such that said transmit power maximizes a weighted function of a data rate achievable over said physical channel and over said individual tone, and at least one concurrent data rate achievable over respective ones of at least one modeled neighboring channel (C2 to CN) and over said individual tone, with the constraint that said transmit power conforms to a transmit power mask,
a second agent (A2) coupled to said first agent, and adapted to determine therefrom a total data rate (B1) achievable over said physical channel and over said at least one tone, and at least one total concurrent data rate (B2 to BN) achievable over respective ones of said at least one modeled neighboring channel and over said at least one tone,
a third agent (A3) coupled to said first agent and to said second agent, and adapted to adjust each weight (W1 to WN) of said weighted function such that said at least one total concurrent data rate is greater than or equal to respective ones of at least one target data rate (BT2 to BTN), and such that said total data rate is maximized, with the constraint that each weight of said weighted function is identical over said at least one tone,
thereby determining by iteration said at least one operational transmit power.

9. A digital communication system according to claim 8, characterized in that said first agent is further adapted to restrict determination of said transmit power to a pre-determined discrete set of data rates as enforced by a coding and/or modulation scheme used over said channel.