# Patent

## Title
Method and device for processing data and communication system comprising such device

## Abstract

A method and a device are provided for processing first data, wherein said first data are distributed, in particular temporally spread over and/or on top of second data. In addition, a communication system comprising such device is suggested.

## Background
BACKGROUND OF THE INVENTION
Field of the Invention
The invention relates to a method and to a device for processing data and to a communication system comprising such device.
The evolution of DSL technology is characterized by achieving higher bit-rates by broadening of the transmission bandwidth. Since both loop attenuation and crosstalk are increasing with frequency more sophisticated measures are necessary to be provided at the DSL transmitter and the DSL receiver.
Currently deployed VDSL2 systems already use bandwidth up to 17 Mhz, while the ITU-993.2 standard suggests a bandwidth of up to 30 Mhz. A typical target bit rate of, e.g., 100 Mbit/sec (amounting to a bidirectional net data rate of 200 Mbit/sec) at a loop length of 0.8 km to 1 km cannot be achieved by current transceiver technology. Crosstalk reduction leads to an increase of reach (maximum admissible loop length at a given rate) or an increase of data rate (at given loop length) or it may result in an increased stability of a “living loop plant” situation (i.e. CPEs turned off and on causing fluctuating crosstalk).
The VDSL2 standard is similar to the legacy ADSL standard, i.e., it has a baseband FFT-based multicarrier QAM-modulation that is adapted to the loop condition. As such the VDSL2 standard follows a so-called “leased line philosophy” according to which the internal bit rate of the DSL link is kept constant and does not adapt to the actual user traffic. This, however, is in contrast to many modern communication systems used in wireless applications and even to the Ethernet application where the line is almost quiet if there is no user traffic.
FIG. 1 shows a traffic simulation assuming three high-definition IPTV channels providing a stationary floor of about 40 Mbit/sec and typical bursts of IP traffic resulting from web browsing applications with peak data rates of more than 100 Mbit/sec.
BRIEF SUMMARY OF THE INVENTION
The problem to be solved is to overcome the disadvantages stated above and in particular to enable a bitrate improvement even for a frequency range with poor signal-to-noise ratio that is able to cope with traffic peaks.
This problem is solved according to the features of the independent claims. Further embodiments result from the depending claims.
In order to overcome this problem, a method is provided for processing first data, wherein said first data are distributed, in particular temporally spread over and/or on top of second data.
Preferably, said first data may be temporally spread over and/or on top of said second data in the sense of switching DMT symbols on and off.
In a multi-user scenario, the bursts of IP traffic can be handled by statistical multiplexing which allows for an aggregation ratio of up to 1:50 without noticeable performance degradation. It is one of advantages of the approach provided herein to utilize such multiplexing gain based on the bursts of said IP traffic. In addition, higher peak rates enable bandwidth efficient retransmission methods to deal with the impulse noise problem which is currently the highest risk for widespread IPTV adoption particularly for carriers with poor in-house cabling environments.
In an embodiment, said second data are modulated and in particular said second data comprise DMT symbols.
In another embodiment, the first data is distributed according to an initial pseudo-random code.
In a further embodiment, said initial pseudo-random code is extended to a pseudo-random orthogonal code, in particular an orthogonal 0/1-valued hierarchical code in a multi-user DSL scenario.
DSL stands for all kinds of digital subscriber lines comprising existing DSL standards as well as upcoming DSL standards.
In a next embodiment, said pseudo-random code is a hierarchical code in particular comprising a binary tree structure.
Hence, the pseudo-random code is structured in a hierarchical way that efficiently allows prioritizing. For example, a first subscriber gets a code of a high level within a tree structure and a second subscriber gets a few codes at the bottom of the tree way below said high level: Referring to the same tree level, the code of the first subscriber corresponds to a lot more ones than zeros than the number of ones assigned to the second subscriber. As the number of ones determines an occurrence of data packets to be conveyed, the first subscriber is entitled to receiving more data packets and thus obtains a higher data rate. This scheme can be used both for pure upstream and/or downstream direction(s) depending on the required service level.
It is also an embodiment that a portion of said first data can be prioritized by being associated with a certain hierarchical stage of said pseudo random code.
Pursuant to another embodiment, the method comprises the steps:

    
    
        identify lines that interfere with one another and
        provide mutually orthogonal pseudo-random codes for such lines that show significant interference, thus in particular avoiding such interference by temporally non-overlapping usage of DMT symbols.
    
    


According to an embodiment, said significant interference is a value of interference above a given threshold value.
Hence, the lines that are subject to noise or disturbance of any kind, in particular interference, may be provided with such pseudo-random codes in order to improve the data rate over such lines.
According to another embodiment, said first data is temporally distributed over and/or on top of said second data.
In yet another embodiment, said first data utilizes a first frequency range and said second data utilizes a second frequency range on top of the first frequency range.
According to a next embodiment, said first data comprises data distributed over several lines and/or ports.
Pursuant to yet an embodiment, said lines or ports are associated with a line-card or with a DSLAM.
It is another embodiment that said first data are utilized for in-band clock synchronization between different DSLAMs and/or different line cards.
Another embodiment states that said first data are utilized for synchronizing a clock signal via quiet line noise registration.
According to an additional embodiment, said first data are utilized for synchronizing a clock signal via a powerline or a wireline or wireless connection.
The problem stated above is also solved by a device comprising a and/or associated with a processor unit and/or a hard-wired circuit and/or a logic device that is arranged such that the method as described herein is executable thereon.
According to an embodiment, said device is a or is associated with a communication device, in particular with a line card or a DSLAM.
The problem stated supra is further solved by a communication system comprising the device as described herein.
Embodiments of the invention are shown and illustrated in the following figures:



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING
FIG. 1 shows a traffic simulation with three high-definition IPTV channels;
FIG. 2 shows a code tree according to an indicator function, wherein the code generated being hierarchic and allows prioritizing;
FIG. 3 shows two ports A and B of a DSLAM or line card conveying traffic to a respective CPE, wherein a bandwidth up to 17 MHz is occupied by a base traffic of a leased line and additional traffic is provided on top of the 17 MHz bandwidth up to an exemplary frequency amounting to 30 MHz;
FIG. 4 shows a flow chart as how to generate the pseudo-random orthogonal code;
FIG. 5 shows two examples for synchronizing a clock signal between two DSLAMs.



DESCRIPTION OF THE INVENTION
The approach suggested utilizes in particular a pseudo-random orthogonal code for traffic spreading over DMT symbols.
Multi-user communication over an interference-limited communication channel may utilize some form of (Hilbert space) orthogonality between the users. Such orthogonality can be obtained by a disjointness in time and/or frequency, the corresponding multiple access schemes are known as time-division multiple access (TDMA) or frequency division multiple access (FDMA).
However, orthogonality can also be achieved by fully time-frequency-overlapping signals, the most prominent example is a so-called code-division multiple access (CDMA) which underlies the legacy North American cellular system IS-95.
The approach provided utilizes in particular orthogonal 0/1-valued pseudo-random codes in said multi-user DSL scenario. In particular, the solution may not introduce any temporal spreading of signals rather than temporally spreading the traffic onto DMT symbols without having to change the DMT modulation format.
This may be achieved by defining a tree-structured traffic distribution code by an indicator function as follows:




  
    
      
        
          
            g
            
              k
              ,
              l
            
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          {
          
            
              
                1
              
              
                
                  the
                  ⁢
                  
                    
                  
                  ⁢
                  n
                  ⁢
                  
                    -
                  
                  ⁢
                  th
                  ⁢
                  
                    
                  
                  ⁢
                  block
                  ⁢
                  
                    
                  
                  ⁢
                  of
                  ⁢
                  
                    
                  
                  ⁢
                  partial
                  ⁢
                  
                    
                  
                  ⁢
                  D
                  ⁢
                  
                    
                  
                  ⁢
                  M
                  ⁢
                  
                    
                  
                  ⁢
                  T
                  ⁢
                  
                    
                  
                  ⁢
                  symbols
                  ⁢
                  
                    
                  
                  ⁢
                  of
                  ⁢
                  
                    
                  
                  ⁢
                  port
                  ⁢
                  
                    
                  
                  ⁢
                  k
                  ⁢
                  
                    
                  
                  ⁢
                  contains
                  ⁢
                  
                    
                  
                  ⁢
                  data
                
              
            
            
              
                0
              
              
                
                  the
                  ⁢
                  
                    
                  
                  ⁢
                  n
                  ⁢
                  
                    -
                  
                  ⁢
                  th
                  ⁢
                  
                    
                  
                  ⁢
                  block
                  ⁢
                  
                    
                  
                  ⁢
                  of
                  ⁢
                  
                    
                  
                  ⁢
                  partial
                  ⁢
                  
                    
                  
                  ⁢
                  D
                  ⁢
                  
                    
                  
                  ⁢
                  M
                  ⁢
                  
                    
                  
                  ⁢
                  T
                  ⁢
                  
                    
                  
                  ⁢
                  symbols
                  ⁢
                  
                    
                  
                  ⁢
                  is
                  ⁢
                  
                    
                  
                  ⁢
                  suppressed
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




Here, the index k stands for the vertical tree index (branching stage) and l is the horizontal tree index (branch) (see FIG. 2).
A block of partial DMT symbols means that

    (i) a number of DMT symbols is added or packed into one block (depending on a DSLAM and/or a line-card granularity and other practical requirements) and
    (ii) a frequency interval or a subset of tones from the power switching according to gk,l(n) is excluded. A particular example for such an exclusion can be a band between 17 Mhz and 30 Mhz. Such scenario may lead to a spectrum usage according to FIG. 3.


The length of the pseudo-random code may provide a power of 2 with the exponent given by a tree height K:

N=2K  (2)

Any usual (balanced) pseudo-random sequence of length N can be taken as the starting point for the code constructions, e.g. shift-register sequences based on irreducible polynomials in a GF(2) (see [2]).
The root code preferably corresponds to a unity signal:

g0,0(n)=1,0≦k<N  (3)

After k-th branching, the number of active DMT symbols is halved compared to the previous state:




  
    
      
        
          
            
              ∑
              
                n
                =
                0
              
              N
            
            ⁢
            
              
                g
                
                  k
                  ,
                  l
                
              
              ⁡
              
                (
                n
                )
              
            
          
          =
          
            2
            
              K
              -
              k
            
          
        
        ,
        
          
        
        ⁢
        
          0
          ≤
          k
          <
          N
        
      
    
    
      
        (
        4
        )
      
    
  




Two different code words on the same tree level are mutually disjoint (which means that the associated transmission signals are mutually orthogonal):




  
    
      
        
          
            
              ∑
              
                n
                =
                0
              
              N
            
            ⁢
            
              
                
                  g
                  
                    k
                    ,
                    l
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
              ⁢
              
                
                  g
                  
                    k
                    ,
                    
                      l
                      ′
                    
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
            
          
          =
          
            
              2
              
                K
                -
                k
              
            
            ⁢
            
              δ
              ⁡
              
                (
                
                  l
                  ,
                  
                    l
                    ′
                  
                
                )
              
            
          
        
        ,
        
          
        
        ⁢
        
          0
          ≤
          k
          <
          N
        
      
    
    
      
        (
        5
        )
      
    
  




All code words on the same tree level are complementary in the sense that summing up results in the unity signal




  
    
      
        
          
            ∑
            
              l
              =
              0
            
            
              K
              -
              1
            
          
          ⁢
          
            
              ∑
              
                n
                =
                0
              
              N
            
            ⁢
            
              
                g
                
                  k
                  ,
                  
                    
                      2
                      ⁢
                      l
                    
                    -
                    1
                  
                
              
              ⁡
              
                (
                n
                )
              
            
          
        
        ≡
        1.
      
    
    
      
        (
        6
        )
      
    
  




Concerning the mapping between users and/or ports and codes, the following is noted:

    a. Priority: Each port does not have to be on the same branching stage of the tree. If, e.g., some user has a higher service level agreement, a higher level code in the tree could be assigned to such user.
    b. Scheduling: On a typical DSL line-card and/or a DSLAM an Ethernet/ATM-based traffic aggregation stage may already be deployed which has to perform some multi-user and/or multiport scheduling tasks. This traffic aggregation processing stage can be connected to the spectrum management method (cross-layer design) provided herewith. Hence, the traffic aggregator assigns code symbol to ports. This information has to be transferred to an actual transceiver chipset.
    c. Overbooking: The number of users can be significantly higher than the number of ports because of (i) a statistical multiplexing gain within typical IP traffic, and (ii) some users may be a priori interference free (e.g., because their loops are fed to different cables).
    d. Vectoring: If the overbooking ratio exceeds the previously mentioned requirements, DSM L3 (vectoring) still may remain a last chance to avoid traffic interference.

Synchronization



Synchronization may be required in order to ensure a non-overlapping of DMT symbols. However, the precision requirements are simplified by the fact that

    (i) a Signal-to-Interference Ratio (SIR) is typically beyond 30 dB (interferers are relatively weak compared to other multiple access situations); and
    (ii) a certain amount of overlap between DMT symbols leads only to a linear decrease of effective SIR after QAM decision (the energy of single QAM symbol is substantially evenly distributed over the DMT-frame length).


Hereinafter, synchronization methods for the approach provided are summarized regarding the scenario of Multi-DSLAM spectrum management:
a. Blind:


    
    
        There is no dedicated physical connection between the DSLAMs. Clock recovery is based on continuous registration of Quiet Line Noise (QLN) (inactive loops before initial training) or on Signal-to-Noise Ratio (SNR) during data transmission thereby exploiting the undesired wireless connection between the loops, i.e., the near-end crosstalk.

b. Inband Ethernet:

        Basically, the Ethernet protocol may be unsynchronized, but there is a tradition to include clock synchronization mechanisms up to a very high degree of precision (see, e.g. RFC 1305, IEEE 1588). It is noted that there are some specifics whenever an Ethernet frame is encapsulated into a DSL physical layer, which, however, can be handled by software-measurements.

c. Powerline:

        In the typical VDSL2 rollout, a Fiber-To-The-Curb (FTTC)-scenario may apply where the DSLAMs are situated in some sort of shelter with standard electrical power connection. This power connection can be used for clock distribution between different DSLAMs of different carriers and/or vendors.

d. External (Wireline or Wireless):

        A dedicated physical connection can be used for clock synchronization purposes. This may require hardware level cooperation between DSLAM vendors. The actual physical connection can be a low-rate wireless (e.g., Zigbee, WLAN, etc.), a wireline or a GPS-based connection.
    
    


FIG. 2 shows a code tree according to the indicator function (1). The code generated is hierarchic and allows prioritizing. The tree may also have an arbitrary root point.
FIG. 3 shows two ports A and B of a DSLAM or line card conveying traffic to a respective CPE. A bandwidth up to 17 MHz is occupied by a base traffic of a leased line according to, e.g., VDSL2. Additional traffic is provided on top of the 17 MHz bandwidth up to an exemplary frequency amounting to 30 MHz resulting in additional 13 MHz bandwidth which is used in one embodiment of the approach provided herewith.
Hence, a data unit 301 has a frequency bandwidth on top of said 17 MHz up to 30 MHz and comprises, e.g. 2000-4000 samples corresponding to a DMT symbol length (e.g. a full FFT duration required for such one symbol). The duration of said data unit 301 corresponds to the duration of an Ethernet packet.
The time period starting at t=0 and lasting until a time k is reached corresponds in particular to a cycle period used for the code generated.
According to data unit 301, further data units 302 to 307 are added to the base traffic of the leased lines of ports A and B. The way to arrange or distribute said data units 301 to 307 on top of the base traffic is based on the pseudo-random code generated. Thus, the data units 301 to 307 use mutually orthogonal symbol sequences to one another.
The scenario of FIG. 3 may in particular be applicable for upstream as well as for downstream traffic.
FIG. 4 shows a flow chart as how to generate the pseudo-random orthogonal code. In a step 401 an initialization is done according to

g0,0(n)=1,n=1, . . . ,N 

and in a step 402 m is set to 0.

In a step 403 it is checked whether

gk,l(n)=1.

If this is the case, it is branched to a step 404 incrementing m (m=m+1) and further processing to a step 405:

gk+1,2l(n)=1−p(m)

gk+1,2l+1(n)=p(m)

p(m) is a pseudo-random sequence which defines the root of all codes (i.e. an identical number of “0”s and “1”s, but randomly distributed). m and n are denoted a time-index within each binary code, whereas k and l denote overall indices. The method provided traverses the code tree for each time index, in particular because for each point in time a code needs to be defined.
After step 405 it is checked in a step 406 whether n<N. Also, if step 403 is provides a false result, it is branched to said step 406. In case n<N, it is branched to a step 407 incrementing n (n=n+1) and continuing with step 403. If n<N is false, l is incremented (l=l+1) in a step 408 and next in a step 409 it is checked whether l<k. If such is true, it is branched to step 402. Otherwise, in a step 410 k is incremented (k=k+1) and in a subsequent step 411 it is checked whether k<K. If this is true, it is branched to step 402, otherwise the method may terminate.
FIG. 5 shows two examples for synchronizing a clock signal between two DSLAMs.
According to example (a) both DSLAMs are fed by one Gigabit Ethernet line providing an inband clock signal to both DSLAMs. Each DSLAM has a number of K ports.
In an example (b), each DSLAM is fed by a separate Gigabit Ethernet line. DSLAM 2 provides via one of its ports 503 a clock signal to a cable binder 501 to which also at least one port 502 of DSLAM 1 is connected. In particular with the line of port 502 being quiet, near-end crosstalk (NEXT) from port 503 to port 502 can be used to determined the clock signal and thus utilize such clock signal for synchronization purposes (quite line noise registration).
Further Advantages:
The approach introduces a tree-structured traffic spreading method for DSL systems resulting in particular in simplified synchronization requirements between DSLAMs and as such can be easily used across DSLAMs in a multivendor and/or multicarrier scenario. Synchronization can be performed either in a blind (crosstalk-induced) or in an inband Ethernet approach.
An exemplary embodiment of this approach can be provided in or together with a cross-layer modulation concept introduced in [1], where the necessary power reduction of DMT symbols is realized by binary precoding rather than explicit change of modulation gains.
REFERENCES


    [1] WO 2005/034459
    [2] D. Jungnickel, “Finite Fields: Structure and Arithmetics”, B.I.-Wissenschaftsverlag, Mannheim, 1993.


ABBREVIATIONS


    CDMA Code-Division Multiple Access
    CPE Customer Premises Equipment
    DMT Discrete Multi-Tone
    DSLAM Digital Subscriber Line Access Module
    DSM Dynamic Spectrum Management
    FDMA Frequency-division Multiple Access
    FFT Fast-Fourier Transformation
    FITC Fiber-To-The-Curb
    NEXT Near-End cross talk
    QAM Quadrature Amplitude Modulation
    QLN Quiet Line Noise
    SIR Signal-to-Interference Ratio
    SNR Signal-to-Noise Ratio
    TDMA Time-division Multiple Access

## Claims

1. A data processing method, which comprises:
processing first data utilizing a first frequency range;
identifying lines that interfere with one another; and
distributing the first data utilizing a first frequency range over second data utilizing a second frequency range according to mutually orthogonal pseudo-random codes for those lines that show significant interference by switching discrete multitone symbols on and off.

2. The method according to claim 1, wherein the first data are distributed according to an initial pseudo-random code.

3. The method according to claim 2, wherein the initial pseudo-random code is a code arranged in a binary tree hierarchical structure.

4. The method according to claim 3, which comprises prioritizing a portion of the first data associated with a certain hierarchical stage of the pseudo-random code.

5. The method according to claim 1, which comprises defining significant interference as a value of interference above a given threshold value.

6. The method according to claim 1, wherein the first data comprises data distributed over a plurality of lines and/or ports.

7. The method according to claim 6, wherein the lines or ports are associated with a line-card or with a digital subscriber line access multiplexer.

8. A data processing device, comprising:
a unit configured to execute thereon the method according to claim 1.

9. The device according to claim 8, wherein said unit is a communications device or said unit is associated with a communication device.

10. The device according to claim 9, wherein said unit is a line card or a digital subscriber line access multiplexer.

11. A communication system, comprising data processing device configured to execute thereon the method according to claim 1.