# Patent

## Title
Method and system for code reuse and capacity enhancement using null steering

## Abstract

The number of users and data capacity of wireless systems are increased by employing apparatus and method for increasing the number of spreading codes available in the system by providing a mechanism to reuse the already allocated spreading code or use the codes that may correlate to those already being used within the same sector/cell. This, in return, provides capacity improvement proportional to the number of added base station (BS) antennas for each cell. An antenna null steering technique for code allocation maintains the cross correlation properties of the codes only for the desired user and to obtain a gain in capacity improvement.

## Background
CROSS REFERENCE TO RELATED APPLICATION
This application claims priority from U.S. provisional application No. 60/335,616, filed Nov. 2, 2001, which is incorporated by reference as if fully set forth.


FIELD OF THE INVENTION
The present invention relates to the field of wireless communication. More specifically, the present invention relates to increasing the number of users and data capacity and data rate of wireless systems. More specifically, in order to increase the capacity, the present invention employs a system which allows the same or correlated signatures to be used for different users simultaneously during the operation of the system.
BACKGROUND OF THE INVENTION
Traditionally, the capacity of Code Division Multiple Access (CDMA) systems, the number of users simultaneously supported in a cell and the data rate allocated to the users, are dependent on availability of the spreading codes functioning as user's signatures, and their cross-correlation properties. If one code is assigned to a user, it cannot be used for the other uses at the same time. This rule is adopted even for the systems with multiple transmission antennas which generates beam steering (beam forming) as a means of interference reduction. Although the current beam steering technology can achieve certain capacity enhancement, the result (of capacity enhancement) is quite limited since the interference cannot be completely removed to a specific location in the field. In addition, from an implementation point of view, such a multiple antenna system is quite complex.
SUMMARY OF THE INVENTION
This invention provides a mechanism to allow reusing the already allocated spreading code or using the codes that may correlate to those already being used within the same sector and/or cell. This in return provides capacity improvement proportional to the number of added Base Station antennas for each cell. The present invention employs an antenna null steering technique for code allocation to maintain the cross correlation properties of the codes only for the desired user and to gain capacity improvement.



BRIEF DESCRIPTION OF THE INVENTION
The present invention will be understood when reading the accompanying description and drawings, wherein like elements are designated by like numerals, and wherein:
FIG. 1 is a schematic diagram of a processing unit embodying the principles of the present invention;
FIG. 2 is a three-dimensional diagram of the combined channel power profiles as calculated in accordance with a mathematical example of the present invention; and
FIG. 3 is a three-dimensional diagram of the combined channel power profiles as calculated in accordance with a mathematical example of the present invention.



DETAILED DESCRIPTION OF THE INVENTION AND THE PREFERRED EMBODIMENTS THEREOF
The present invention uses a simple antenna null steering technique for suppressing the power of the undesired interference signals, which may use the same or correlated spreading codes, at a desired receiver. Since the spreading codes can be reused simultaneously, the capacity of the whole system can be increased. The simplicity and ease of implementation is one advantage of the null steering method. However, due to the ease of implementation, the null steering technique can be used as a complementary method along with beam steering to provide further improvement of system capacity.
The concept may use different spreading codes, users and antennas. However, the present invention is described using the same or correlated spreading code for N users simultaneously, utilizing N+1 antennas. Channel information such as the spatial information is used by N+1 antennas of a Base Station BS to create a null at all user locations with the identical or correlated spreading code but the desired one. The concept is illustrated below for the case where N=2, where N=the number of users.
Considering a two-user case. The system is depicted in FIG. 1, where, for i=1, 2, 3, hiA and hiB represent the channel impulse responses from antenna i to user A and user B, respectively. dA and dB indicate the data transmitted to the user A and B, respectively. Note that data dA and dB are spread by the same or correlated codes {cA(k), k=1, 2, . . . } and {cB(k), k=1, 2, . . . } before data transmission at the base station. Our objective is to transmit information for user A without creating any interference to user B and, at the same time, transmit information for user B without creating any interference to user A. This objective is achieved by creating a null at the location of user B by altering the composite channel impulse response from BS to user A and creating a null at the location of user A by altering the composite channel impulse response from BS to user B. Here the composite channel impulse response is defined as a transfer function from spreader output at the BS to the antenna user's receiver unit.
To create a null at user B, we will select the complex weights, W1A, W2A and W3A so that the gain of the composite channel from the base station to user A is maximized and the composite channel gain from the base station to user B is 0. Mathematically, it is a constraint optimization problem, which can be expressed as follows:




  
    
      
        
          
            max
            
              
                w
                
                  1
                  ⁢
                  A
                
              
              ,
              
                w
                
                  2
                  ⁢
                  A
                
              
              ,
              
                w
                
                  3
                  ⁢
                  A
                
              
            
          
          ⁢
          
            
              
                (
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    3
                  
                  ⁢
                  
                    
                      w
                      iA
                    
                    ⁢
                    
                      h
                      iA
                    
                  
                
                )
              
              *
            
            ⁢
            
              (
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  3
                
                ⁢
                
                  
                    w
                    iA
                  
                  ⁢
                  
                    h
                    iA
                  
                
              
              )
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            subject
            ⁢
            
              
            
            ⁢
            to
            ⁢
            
              
            
            ⁢
            
              
                ∑
                
                  i
                  =
                  1
                
                3
              
              ⁢
              
                
                  w
                  iA
                
                ⁢
                
                  h
                  iB
                
              
            
          
          =
          0
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        1
      
    
  




Similarly, to create a null at user A, we will select the complex weights, w1B, w2b and w3b so that the gain of the composite channel from the base station to user B is maximized and the composite channel gain from the base station to user A is 0. Mathematically, it is likewise a constraint optimization problem, which can be expressed as follows:




  
    
      
        
          
            max
            
              
                w
                
                  1
                  ⁢
                  B
                
              
              ,
              
                w
                
                  2
                  ⁢
                  B
                
              
              ,
              
                w
                
                  3
                  ⁢
                  B
                
              
            
          
          ⁢
          
            
              
                (
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    3
                  
                  ⁢
                  
                    
                      w
                      iB
                    
                    ⁢
                    
                      h
                      iB
                    
                  
                
                )
              
              *
            
            ⁢
            
              (
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  3
                
                ⁢
                
                  
                    w
                    iB
                  
                  ⁢
                  
                    h
                    iB
                  
                
              
              )
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            subject
            ⁢
            
              
            
            ⁢
            to
            ⁢
            
              
            
            ⁢
            
              
                ∑
                
                  i
                  =
                  1
                
                3
              
              ⁢
              
                
                  w
                  iB
                
                ⁢
                
                  h
                  iA
                
              
            
          
          =
          0
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        2
      
    
  




The optimization problem described above can be easily solved. Next, as an example, we show how to determine w1A, w2A and w3A from Equation 1. First from the constraint in Equation 1, we choose w3A as follows:




  
    
      
        
          w
          
            3
            ⁢
            A
          
        
        =
        
          -
          
            
              
                
                  w
                  
                    1
                    ⁢
                    A
                  
                
                ⁢
                
                  h
                  
                    1
                    ⁢
                    B
                  
                
              
              +
              
                
                  w
                  
                    2
                    ⁢
                    A
                  
                
                ⁢
                
                  h
                  
                    2
                    ⁢
                    B
                  
                
              
            
            
              h
              
                3
                ⁢
                B
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        3
      
    
  




Applying w3A, the composite channel impulse response at user A becomes:

w1Ag1+w2Ag2;  Equation 4

where,





  
    
      
        
          
            g
            i
          
          =
          
            
              
                h
                iA
              
              -
              
                
                  
                    h
                    
                      3
                      ⁢
                      A
                    
                  
                  
                    h
                    
                      3
                      ⁢
                      B
                    
                  
                
                ⁢
                
                  h
                  iB
                
                ⁢
                
                  
                
                ⁢
                for
                ⁢
                
                  
                
                ⁢
                i
              
            
            =
            1
          
        
        ,
        2
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        5
      
    
  




In general, gi is a complex number. Define gi=αieJφi for i=1, 2; where αi>0 for i=1, 2. Also, define




  
    
      w
      iA
    
    =
    
      
        
          e
          
            j
            ⁢
            
              
            
            ⁢
            
              θ
              i
            
          
        
        ⁢
        
          
        
        ⁢
        for
        ⁢
        
          
        
        ⁢
        i
      
      =
      1
    
  
  ,
  2.




It can be shown that the channel gain of the composite channel impulse response from the base station to user A is




  
    
      
        
          
            
              (
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  3
                
                ⁢
                
                  
                    w
                    iA
                  
                  ⁢
                  
                    h
                    iA
                  
                
              
              )
            
            *
          
          ⁢
          
            (
            
              
                ∑
                
                  i
                  =
                  1
                
                3
              
              ⁢
              
                
                  w
                  iA
                
                ⁢
                
                  h
                  iA
                
              
            
            )
          
        
        =
        
          
            a
            1
            2
          
          +
          
            a
            2
            2
          
          +
          
            2
            ⁢
            
              a
              1
            
            ⁢
            
              a
              2
            
            ⁢
            
              cos
              ⁡
              
                (
                
                  
                    θ
                    2
                  
                  -
                  
                    θ
                    1
                  
                  +
                  
                    φ
                    2
                  
                  -
                  
                    φ
                    1
                  
                
                )
              
            
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        6
      
    
  




It is clear that, to reach the maximum possible gain, we should have:

θ2−θ1+φ2−φ1=0  Equation 7

One approach to satisfy the above equation is to choose:




  
    
      
        
          
            w
            iA
          
          =
          
            
              
                1
                
                  a
                  i
                
              
              ⁢
              
                g
                i
                *
              
              ⁢
              
                
              
              ⁢
              for
              ⁢
              
                
              
              ⁢
              i
            
            =
            1
          
        
        ,
        2
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        8
      
    
  




For example, define a simplified channel model as




  
    
      
        
          
            h
            ip
          
          =
          
            exp
            ⁡
            
              (
              
                j
                ⁢
                
                  
                
                ⁢
                2
                ⁢
                
                  
                
                ⁢
                π
                ⁢
                
                  
                    D
                    ip
                  
                  λ
                
              
              )
            
          
        
        ;
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        9
      
    
  




for i=1, 2, 3, and p=A, B, where Dip is the distance from user p to antenna i, and λ is the wavelength, which is 0.15 m in this example. In addition, we assume that the three (3) antennas are distributed along the X axis in a OXY plane with space between two adjacent antennas being 0.75 m and antenna 2 being placed at the origin (O) of the OXY plane. We choose the location for user A being (xA, yA)=(−70,20) and user B being (xB,yB)=(50, 50). The composite channel power profiles (in dB) near these two points are shown in FIG. 2 and FIG. 3, respectively. Thus, by generating the complex values w1A, w2A and w3A, the desired user A, in the example of FIG. 1, will receive the communication with maximum power (FIG. 2) whereas the power at the other user will be nulled (FIG. 3).

## Claims

1. A null beam technique wherein only one of at least two remote users, all of whom employ a same or a correlated spreading code within a given cell or sector, is enabled to receive a communication from a base station transmitting to the at least two remote users, said base station transmitting to said remote users over an antenna array having a plurality of antennas, comprising:
a) said base station modulating data di, for i=1, . . . , N, intended for one of N (N>1) remote users with N+1 complex weights wi (for i=1, . . . , N, each is a N+1 complex vector), each modulated signal being directed to one of said N+1 antennas;
wherein each element of the vectors w1 and w2 is a function of the channel impulse responses from the antenna array to locations of the remote users;
b) summing the modulated data signals d1, d2, . . . dN and
c) transmitting the summed signals.

2. The method of claim 1 wherein the complex weights wi are made a function of the number of antennas in the array.

3. The method of claim 1 wherein step (c) comprises transmitting over an array of at least two (2) antennas.

4. The method of claim 1 wherein step (a) includes selecting the complex weights so that a power of a communication received by a first one of the remote users from the base station is maximized.

5. The method of claim 4 wherein step (a) includes selecting the complex weights so that a power of a communication received by a second one of the remote users from the base station is minimized.

6. A null beam technique wherein only one of at least two remote users, all of whom employ different spreading code within a given cell or sector, is enabled to receive a communication from a base station transmitting to the at least two remote users, said base station transmitting to said remote users over an antenna array having a plurality of antennas, comprising:
a) said base station modulating data di, for i=1, . . . , N, intended for one of N (N>1) remote users with N+1 complex weights wi (for i=1, . . . , N, each is a N+1 complex vector), each modulated signal being directed to one of said N+1 antennas;
whereas each of the element of the vectors w1 and w2 is a function of the channel impulse responses from the antenna array to the location of all remote users;
b) summing the modulated data signals d1, d2, . . . dN and
c) transmitting the summed signals.

7. The method of claim 6 wherein the complex weights wl are made a function of the number of antennas in the array.

8. The method of claim 6 wherein step (c) comprises transmitting over an array of at least three (3) antennas.

9. The method of claim 6 wherein step (a) includes selecting the complex signals so that a power of a communication received by a first remote user from the base station is maximized.

10. The method of claim 9 wherein step (a) includes selecting the complex signals so that a power of a communication received by a second remote user from the base station is minimized.

11. A base station employing a null beam technique wherein only one of at least two remote users, all of whom employ a same or a correlated spreading code within a given cell or sector, is enabled to receive a communication from a base station transmitting to the at least two remote users, said base station transmitting to said remote users over an antenna array having a plurality of antennas, comprising:
said base station having means for modulating data di, for i=1, . . . , N, intended for one of N (N>1) remote users with N+1 complex weights wi (for i=1, . . . , N, each is a N+1 complex vector), each modulated signal being directed to one of said N+1 antennas;
wherein each element of the vectors w1 and w2 is a function of the channel impulse responses from the antenna array to locations of the remote users;
means for summing the modulated data signals d1, d2, . . . dN; and
means for transferring the summed signals to the antenna array for transmission.

12. The base station of claim 11 further comprising means for generating complex weights wi as a function of the number of antennas in the array.

13. The base station of claim 11 wherein the array is comprised of at least two (2) antennas.

14. The base station of claim 11 further comprising means for selecting the complex weights so that a power of a communication received by a first one of the remote users from the base station is maximized.

15. The base station of claim 14 further comprising means for selecting the complex weights so that a power of a communication received by a second one of the remote users from the base station is minimized.