Abstract:
A method is provided for accomplishing asymmetric digital subscriber loop classification and the design of passive hybrid networks for each of the classes. The resulting hybrids are suitable for implementation in a switchable hybrid architecture.

Description:
RELATED PATENT APPLICATIONS  
       [0001]    This application claims the benefit, under 35 U.S.C. §119(e)(1), of U.S. Provisional Application No. 60/354,698, entitled SWITCHABLE HYBRID DESIGN FOR ADSL, filed Feb. 4, 2002 by Fernando A. Mujica. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    1. Field of the Invention  
           [0003]    This invention relates generally to ADSL hybrid networks, and more particularly to a method of providing a switchable hybrid design suitable for ADSL applications.  
           [0004]    2. Description of the Prior Art  
           [0005]    The goal of the hybrid network is to model the transmit echo path transfer function to perform analog echo cancellation. Using a passive termination line driver, the transmit echo transfer function is given by  
           H   Echo          (   f   )       =         Z   L   ′          (   f   )           R   T     +       Z   L   ′          (   f   )                                 
 
           [0006]    where Z′ L  is the line impedance as seen from the receive terminals (modem side) of the transformer. Denoting the hybrid transfer function as H Hyb , the hybrid echo rejection is defined as  
             H   Echo Rejection (ƒ)= H   echo (ƒ)− H   Hyb (ƒ).  
           [0007]    It is well known that the line impedance, and therefore Z′ L , varies a great deal for different loop topologies, in particular in the presence of bridge-taps. FIGS. 1 a  and  1   b  illustrate the severity of the problem in which real and imaginary parts of the impedance are shown for straight loops (FIG. 1 a ) and some bridge tap loops (FIG. 1 b ) respectively.  
           [0008]    It is clear that a single hybrid network cannot achieve the same cancellation levels for all possible loop scenarios. It would therefore be advantageous in view of the foregoing to provide an adaptive hybrid network capable of achieving substantially the same cancellation levels for all possible loop scenarios associated with a particular application.  
         SUMMARY OF THE INVENTION  
         [0009]    The present invention is directed to a method of accomplishing loop classification and the design of hybrid networks for each of the classes. The resulting hybrids are suitable for implementation in a switchable hybrid architecture.  
           [0010]    A method according to one embodiment of the invention comprises the steps of dividing a plurality of subscriber loops into a desired number ‘C’ of classes; determining a target transfer function for each class; and approximating each target transfer function with a linear system capable of being synthesized in hardware.  
           [0011]    According to another embodiment, an adaptive passive hybrid system comprises a plurality of passive hybrid networks, each passive hybrid network having a corresponding optimized hybrid transfer function; and a switching element configured to selectively switch each passive hybrid network, such that each passive hybrid network operates to substantially match its corresponding optimized hybrid transfer function with an associated transmit echo transfer function for a desired class of asymmetric digital subscriber loops.  
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0012]    Other aspects and features of the present invention and many of the attendant advantages of the present invention will be readily appreciated as the same become better understood by reference to the following detailed description when considered in connection with the accompanying drawings in which like reference numerals designate like parts throughout the figures thereof and wherein:  
         [0013]    [0013]FIGS. 1 a  and  1   b  are graphs illustrating real and imaginary parts of the impedance for straight loops and some bridge tap loops respectively;  
         [0014]    [0014]FIG. 2 is a diagram illustrating the general shape of a target minimum hybrid echo cancellation transfer function;  
         [0015]    [0015]FIG. 3 is a diagram depicting a digital subscriber line “space” and sub-sets of associated loops for which a corresponding hybrid achieves the target minimum hybrid echo rejection transfer function;  
         [0016]    [0016]FIGS. 4 a  and  4   b  illustrate echo transfer functions (including first stage HPF) for all loops of interest associated with one exemplary loop classification;  
         [0017]    [0017]FIGS. 5 a  and  5   b  illustrate resulting class 1 target transfer functions associated with a plurality of classes when using a 2 nd  order linear system approximation and passive hybrid transfer functions;  
         [0018]    [0018]FIGS. 6 a  and  6   b  illustrate resulting class 2 target transfer functions associated with a plurality of classes when using a 2 nd  order linear system approximation and passive hybrid transfer functions;  
         [0019]    [0019]FIGS. 7 a  and  7   b  illustrate resulting class 3 target transfer functions associated with a plurality of classes when using a 2 nd  order linear system approximation and passive hybrid transfer functions;  
         [0020]    [0020]FIG. 8 depicts upstream performance comparisons for all loops associated with a passive hybrid, an adaptive hybrid optimum solution (target hybrid transfer functions) and an adaptive hybrid approximation (2 nd  order linear system);  
         [0021]    [0021]FIG. 9 depicts downstream performance comparisons for all loops associated with a passive hybrid, an adaptive hybrid optimum solution (target hybrid transfer functions) and an adaptive hybrid approximation (2 nd  order linear system);  
         [0022]    [0022]FIG. 10 shows a pole-zero plot for three 2 nd -order hybrids; and  
         [0023]    [0023]FIG. 11 depicts a receive HPF and an adaptive hybrid topology associated with C passive hybrid networks according to one embodiment of the present invention.  
         [0024]    While the above-identified drawing figures set forth alternative embodiments, other embodiments of the present invention are also contemplated, as noted in the discussion. In all cases, this disclosure presents illustrated embodiments of the present invention by way of representation and not limitation. Numerous other modifications and embodiments can be devised by those skilled in the art which fall within the scope and spirit of the principles of this invention.  
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0025]    In practice, the adaptability of the hybrid network is realized through the selection of a subset of hybrid networks. Selecting among the possible hybrid networks is done based on channel analysis information obtained during modem initialization.  
         [0026]    The hybrid network must operate over the upstream and downstream frequency bands. The hybrid echo cancellation in the upstream (A US ) band is needed to prevent saturation of the receiver. As such, the quantity of interest is the total power attenuation in the upstream band or  
             A   US          (     H     Echo                 Rejection       )       =       1       f     +   US       -     f     -   US                  ∫     f     -   US         f     +   US                  H     Echo                 Rejection            (   f   )          df           ,                         
 
         [0027]    with ƒ +US  and ƒ −US  the maximum and minimum frequencies in the upstream band, respectively. The hybrid echo cancellation in the downstream band (A DS ) is needed to further reduce the out-of-band transmit noise. In this case, the figure of merit is the minimum attenuation in the downstream band or  
             A   DS          (     H     Echo                 Rejection       )       =       min       f   -   DS     &lt;   f   &lt;     f   +   DS              (       H     Echo                 Rejection            (   f   )       )         ,                         
 
         [0028]    with ƒ +DS  and ƒ −DS  the minimum and maximum frequencies in the downstream band, respectively. Since the energy in the upstream band is much larger than the out-of-band noise, the hybrid is designed to provide higher rejection in the upstream band relative to the rejection in the downstream band. The general shape of the hybrid echo cancellation transfer function  100  is depicted in FIG. 2.  
         [0029]    The adaptive hybrid solution according to one embodiment requires the design of a number of hybrid networks which result in acceptable performance for all loops belonging to the corresponding class. As such, loops must be classified into classes before the actual hybrid networks can be realized. In FIG. 3, a representation according to one embodiment is shown of all possible loops  200  and sub-sets  202 ,  204 ,  206  for which the indicated hybrid achieves the hybrid echo rejection targets. Loops that fall within one of these subsets are guaranteed to result in a hybrid echo rejection of at least A US  and A DS  in the upstream and downstream bands, respectively. Most preferably, the intersection(s)  208 ,  210  of these sub-sets will cover most loops of practical interest. The present inventor recognized that the echo cancellation “space” is actually multi-dimensional; and the problem at hand is therefore one of clustering.  
         [0030]    Classification methodology according to the particular embodiments presented herein are best understood when first noticing that the best hybrid transfer function for a particular loop condition is  
           H   Hyb (ƒ)= H   Echo (ƒ),  
         [0031]    which results in infinite hybrid rejection. Similarly, the best hybrid transfer function for a particular group of loops must be a linear combination (maybe weighted) of the corresponding echo transfer functions H Echo,k (ƒ) for each of the loops in the group, i.e.,  
             H   Hyb   *          (   f   )       =       1   K            ∑     k   =   1     K                       H     Echo   ,   k            (   f   )             ,                         
 
         [0032]    where K is the number of echo transfer functions (loops) considered in the group. If the relative importance of one loop versus another within the group is known, a weighted version of the previous expression can be used, i.e.,  
           H   Hyb   *          (   f   )       =       1     ∑     α   k                ∑     k   =   1     K                       α   k              H     Echo   ,   k            (   f   )       .                                 
 
         [0033]    Thus, the target hybrid transfer function of a particular class is formed as the “center of mass” of the cluster.  
         [0034]    According to one embodiment, classification is done in the following way. Assume first the loops in consideration belong to the set J=(1, . . . K} with K the total number of loops, and that we want to divide the loops into C classes. Next, define the hybrid performance goals per class as A US(1), . . . ,  A US(C) , and A DS(1), . . . ,  A DS(1) , for the upstream and downstream frequency regions, respectively. With these definitions and setting J 1 =J, we can form  
                       A   US          (     m   ,   n     )       =       A   US          (       H     Echo   ,   m       -     H     Echo   ,   n         )                       A   DS          (     m   ,   n     )       =       A   DS          (       H     Echo   ,   m       -     H     Echo   ,   n         )               }                   with                 n     ,     m   ∈     J   1                             
 
         [0035]    which represents the hybrid performance for loop ‘n’ when the echo rejection for loop ‘m’ is used as the hybrid transfer function.  
         [0036]    A cost function M 1  is now defined as  
           M   1          (   m   )       =           ∑     n   ∈                J   1              Aus        (     m   ,   n     )         +         A   DS          (     m   ,   n     )                     with                 m       ∈       J   1     .                             
 
         [0037]    The index ‘m 1 ’ corresponding to the largest M 1  represents the loop index with the largest number of “closer” loops. Loop m 1  and its K 1  closest loops are then assigned to class C 1 . The process is then iterated for the next class using the remainder of the loops, i.e.,  
         J   2     =       {     J     J   1       }     .                           
 
         [0038]    In general, each iteration uses the loops not previously classified, or  
         J   c     =     {     J       J     1   ,              …              ,            J     c   -   1           }                           
 
         [0039]    with c=(1, . . . , C); and the (sparse) matrices can then be formed as  
           M   c          (   m   )       =           ∑     n              ∈                J   c              Aus        (     m   ,   n     )         +         A   DS          (     m   ,   n     )                     with                 m       ∈       J   c     .                             
 
         [0040]    The index ‘m c ’ corresponding to the largest M c  represents the loop index with the largest number of “closer” loops. Loop m c  and its K c  closest loops are then assigned to class C c . After the classification iteration is completed, the target hybrid function for each class can then be determined as described herein before by calculating the (weighted) average of all echo transfer functions for all loops in the class.  
         [0041]    It is possible that certain loops were not properly classified, such that the set  
         J     C   +   1       =     {     J       J     1   ,              …              ,            J   C         }                           
 
         [0042]    is non-empty, the reason being that these loops did not satisfy the performance goals used in the classification stage. In this case, all loops in J C+1  can be assigned to the class that results in the best performance using the corresponding target hybrid transfer function.  
         [0043]    Once the target transfer functions for each class have been found, they must then be approximated with a linear system that can be synthesized in hardware, i.e.,  
             H   ~     Hyb          (   s   )       =             b     N   B            S     N   B         +   …   +     b   iS   1     +     b   0           a       N   A          S     N   A           +   …   +     a   iS   1     +     a   0         .                           
 
         [0044]    The order of the system is typically constrained by the complexity of the hardware; and it is a design parameter. The numerator and denominator coefficients can be determined by finding a least squares fit of the linear system to the target hybrid transfer function, i.e.,  
         min           b       N   B     ,   ⋯              ,     b   0                   a       N   A     ,   ⋯              ,     a   0                        (     ∫       W        (   f   )                         H   ~     Hyb          (     2      π                 fj     )       -       H   Hyb   *          (   f   )              2        df       )     .                           
 
         [0045]    The weighting function W(ƒ) an be used to improve the approximation over a particular e upstream band.  
         [0046]    The next step is to verify that the hybrid approximation is satisfactory in terms of performance a compared with that for the target hybrid transfer function. Finally, the resulting model is synthesized in an actual hardware implementation.  
         [0047]    Intuitively, the higher the hybrid performance goals the more classes will be needed. Further, the order of the linear model approximations most likely would increase also for certain classes. Thus, when only few hybrid options are available, a lower order approximation might be more appropriate, as it will be able to capture the “average” behavior of the class rather than the detailed characteristics.  
         [0048]    It is also possible to find the least square fit of a transfer function with C real poles and zeros.  
             H   ~     Hyb          (   s   )       =     K          s   -     z   1         s   -     p   1                s   -     z   2         s   -     p   2            ⋯          s   -     z   C         s   -     p   C                                 
 
         [0049]    Table 1 shows the test loops considered in one loop classification example. The loop index is used to refer to the particular loop in the plots shown in FIGS. 4 a  and  4   b .  
                                                   TABLE 1                           Test loops.            Loop type   Loop number   Variable length segment (ft)   Loop index                    26 AWG   —   3000   1           —   6000   2           —   9000   3           —   12000   4           —   15000   5       CSA   1   —   6           2   —   7           4   —   8           5   —   9           7   —   10       ANSI   2   —   11           5   —   12           6   —   13           9   —   14           12   —   15           13   —   16                  
 
         [0050]    The particular system employed in the loop classification examples discussed herein comprised a A×5 (TI 5 th  generation ADSL client-side codec) front-end available from Texas Instruments Incorporated of Dallas, Tex., with a Schott 33818 transformer, two 68 nF coupling capacitors, and a first-stage receive high pass filter (HPF) with a transfer function defined by  
             H   HPF          (   s   )       =         R   0     R          s     s   +     1   RC             ,                         
 
         [0051]    with R=R 0 =732 ohm and C=680 pF. The echo transfer functions for the loops, including the first stage HPF, are shown in FIGS. 4 a  and  4   b . Three classes (C=3) were employed, in which  
         A US(1) =A US(2) =A US(3) =35 dB and A DS(1)   =A   DS(2)   =A   DS(3) =15 dB.  
         [0052]    The final classification is shown in Table 2. Loops marked with an asterisk were assigned after the initial classification was performed.  
                                                   TABLE 2                           Loop classification results.                Class   Loop   Loop index                            1   AWG 26 3000   1               AWG 26 6000   2               AWG 26 9000   3               AWG 26 12000   4               AWG 26 15000   5               CSA 1   6               CSA 5   9               ANSI 12   15               CSA 4*   8               ANSI 6*   13               ANSI 13*   16           2   ANSI 2*   11               ANSI 5   12               ANSI 9   14           3   CSA 2   7               CSA 7   12                      
 
         [0053]    The resulting target hybrid transfer functions 302, 312, 310 are shown for each of the classes (1, 2 and 3) in FIGS. 5 a  and  5   b , FIGS. 6 a  and  6   b  and FIGS. 7 a  and  7   b  respectively along with the echo transfer functions of the loops in the corresponding class (thin curves). The 2 nd  order linear system approximation (N B =N A =2) is also depicted in FIGS.  5 - 7  by curves  303 ,  314 ,  320  respectively; while curves  301 ,  311 ,  307  depict a passive hybrid transfer function using a A×5 hybrid discussed herein before.  
         [0054]    The upstream and downstream performance comparison  400 ,  500  between the passive  401 ,  501 , adaptive optimum (target hybrid transfer function)  402 ,  502  and adaptive approximation (2 nd  order transfer function)  403 ,  503  are shown in FIGS. 8 and 9 respectively. The adaptive hybrid optimum solution  402 ,  502  outperforms the passive  401 ,  501  for almost all loops. Similarly, the adaptive hybrid approximation  403 ,  503  offers gains with respect to the passive solution  401 ,  501  but not as dramatic as with the optimum hybrid solution  402 ,  502 , yet significant enough to justify its implementation.  
         [0055]    Examination of the 2 nd  order approximation for each of the hybrids reveals that they have only real poles and zeros as seen in FIG. 10. This result is not surprising since the hybrid has to emulate the first stage HPF which has a zero at DC and a real pole. There is therefore no other alternative for the additional pole and zero but to lie on the real axes as well. This result is significant because it demonstrates that for a second order hybrid, it is not required to implement the hybrid as an active network (arbitrary coefficient second order section). Instead, the hybrid can be implemented with a passive network; and the subtracting operation can be implemented with the same op-amp used for the first stage HPF.  
         [0056]    One appropriate topology  600  is shown in FIG. 11. The transfer function of the hybrids  602 ,  604 ,  606  is given by  
           H   Hyb          (   s   )       =       R0   R3              1   +       (     C1R1   +   C2R2   +   C1R3   +   C2R3     )        s     +       C1C2        (     R1R2   +   R1R3   +   R2R3     )            s   2             (     1   +   C1R1s     )          (     1   +   C2R2s     )         .                             
 
         [0057]    Using Mathematica, the parameters of the three hybrid networks are then readily determined by equating the resulting 2 nd  order hybrid models with the hybrid network transfer functions. The 2 nd  order models and the corresponding solutions are shown below as  
               H   Hyb1     =           -   1.6569     ×     10     -   11            s   2       -     4.1947   ×     10     -   5          s     +   1           -   2.4759     ×     10     -   11            s   2       -     1.5652   ×     10     -   4          s     -   111.2731                     H   Hyb1     =           -   5.9774     ×     10     -   12            s   2       -     7.1478   ×     10     -   6          s     +   1           -   8.6488     ×     10     -   12            s   2       -     6.3617   ×     10     -   5          s     -   11.5212                     H   Hyb1     =           -   5.5509     ×     10     -   12            s   2       -     1.2111   ×     10     -   5          s     +   1           -   7.0687     ×     10     -   12            s   2       -     6.7762   ×     10     -   5          s     -   20.2392                                   
 
         [0058]    Hybrid 1 solution:  
         [0059]    R1=1731, R2=2867, R3=−81452, C1=1.0492e-10, C2=4.27334e-10  
         [0060]    Hybrid 2 solution:  
         [0061]    R1=1243, R2=3872, R3=−8434, C1=1.1220e-10, C2=1.3901e-9  
         [0062]    Hybrid 3 solution:  
         [0063]    R1=1181, R2=3403, R3=−14815, C1=9.1232e-11, C2=9.5224e-10  
         [0064]    The present inventor recognized that the negative R3 values could be easily implemented by taking the opposite signal from the differential implementation.  
         [0065]    Using this topology  600 , one of C passive hybrid networks can be selected by using switches  608 , which may, for example, be integrated into a codec. This approach is depicted in FIG. 11.  
         [0066]    Since the circuit topology  600  is differential, two extra pins were found to be required for each additional hybrid option. One embodiment, for example, may include the addition of two hybrid options or 4 pins for a total of 3 possible hybrid networks. This topology was found to offer the greatest flexibility in one embodiment where all the hybrid components are external passive elements (resistors and capacitors).  
         [0067]    In summary explanation, a methodology has been described to accomplish loop classification and the design of hybrid networks for each of the classes. The resulting hybrids were shown to be suitable for implementation in a switchable hybrid architecture. Implementation examples and estimated performance were presented.  
         [0068]    This invention has been described in considerable detail in order to provide those skilled in the ADSL hybrid art with the information needed to apply the novel principles and to construct and use such specialized components as are required. In view of the foregoing descriptions, it should be apparent that the present invention represents a significant departure from the prior art in construction and operation. However, while particular embodiments of the present invention have been described herein in detail, it is to be understood that various alterations, modifications and substitutions can be made therein without departing in any way from the spirit and scope of the present invention, as defined in the claims which follow. For example, while certain embodiments set forth herein illustrate various hardware implementations, the present invention shall be understood to also parallel structures and methods using software implementations as set forth in the claims.