# Patent

## Title
Method for multiple antenna transmission

## Abstract

There is disclosed a duplex communication system having multiple antennae at the forward link transmitter. One method of transmitting a stream of information symbols from the antennae is by beamforming. With beamforming the transmitter typically operates in closed loop and uses channel information from the receiver to change beams in the forward link. Another approach employs orthogonal coding. Orthogonal coding can be simpler to implement because it can operate in an open loop system that is without channel knowledge at the transmitter. Each has its advantages and disadvantages. What is here disclosed is a method which is an alternative to using only beamforming or orthogonal coding. The signals transmitted from at least two antennae are by beamforming or orthogonal coding; or by beamforming in combination with orthogonal coding in a proportion that is determined by a reference value which is related to the differences between the signals from the antennae. The reference value can be related to the amplitude or phase of the signals and it can be either measured or estimated.

## Background
CROSS REFERENCE TO RELATED APPLICATION
Related subject matter is disclosed in the following application assigned to the same assignee hereof: U.S. patent application entitled “Method For Multiple Antenna Transmission Using Partial Channel Knowledge,” Ser. No. 09/851,858, filed on May 9, 2001.
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to wireless communication systems and more particularly to a method for effective wireless communication in the presence of fading and/or other degradations.
2. Description of the Related Art
The capacity and data rate of existing code division multiple access (CDMA) systems can be increased by using multiple antennas at the transmitter. The need to provide increased data rates to a large number of users is an especially urgent problem in both the downlink (base-to-mobile) and the uplink (mobile-to-base) in third generation (3G) wideband CDMA systems. Antenna arrays have been often proposed as a means to improve performance in both links of CDMA systems. In the uplink, an antenna array can be employed at the base station (BS) to provide array gain, interference reduction, and diversity gain. (See “Space-time processing for wireless communications,” by A. Paulraj and C. Papadias, IEEE Signal Processing Magazine, Vol. 14, pp. 49-83, November 1997.) This can, in turn, provide improved range, quality, and capacity in the reverse link of the system.
Since Bus can accommodate the electronics, power consumption, and size of antenna arrays, receive diversity techniques are easily implemented. However, similar improvements on the downlink seem to be harder to obtain. The physical demands of antenna-array processing units make the use of multiple antennas at the mobile handset problematic. The small size of handheld units limits both the spatial resolution of the array (because of the small number of elements), as well as the diversity gain (because the elements are close to one another). It therefore seems more feasible to perform forward-link spatial processing at the BS transmitter.
One possible approach for antenna-array transmit processing is by beamforming which provides array gain at the subscriber unit. In these schemes, the transmitter typically operates in “closed-loop,” i.e., it uses channel information that is fed to it by the receiver through the reverse link in order to shape beams in the forward link (base-to-mobile). The success of transmit beamforming depends on the quality of the channel estimates, the feedback channel, the mapping between the two links, and the dynamics of the signal and interference. Closed-loop techniques typically suffer from reduced reverse link capacity because of the extra channel information that is transmitted.
Another approach employs transmit diversity or orthogonal space-time coding (STC) at the base station with the goal of providing diversity gain to the mobile subscriber. Transmit diversity can be simpler to implement because it can operate in an open-loop, that is, without channel knowledge at the transmitter. This mode of operation is particularly appealing when the mobile speed is high enough to make channel estimation and tracking too difficult. Moreover, open-loop techniques do not penalize the reverse link capacity as closed-loop techniques do. These arguments suggest that multiple-antenna open-loop transmit diversity is a practical way to improve the performance of current systems.
Some open-loop transmit diversity techniques for the CDMA forward link are disclosed in “A comparison of base station transmit diversity methods for third generation cellular standards,” by K. Rohani, M. Harrison and K. Kuchi, in Vehicular Technology Conference, 1999 IEEE 49th, Volume 1, 1999, pages 351-355; “Performance analysis of CDMA transmit diversity methods,” by L. M. A. Jalloul, K. Rohani, K. Kuchi and J. Chen, Vehicular Technology Conference, 1999, VTC 1999, Fall, IEEE VTS 50th, Volume 3, pages 1326-1330; and in “Diversity for the direct-sequence spread spectrum system using multiple transmit antennas,” by V. Weerackody, AT&T Tech. Memo., 1993. In Rohani et al, the spatial diversity inherent in the channel is not fully exploited. This drawback can be compensated when the mobile travels quickly since the receiver gains diversity through temporal fluctuations in the channel (exploited through coding and interleaving). However, when the mobile is stuck in a deep fade on a slow-fading channel, any temporal diversity advantage is lost. Since many 3G wireless data users may be either static or moving at low (pedestrian) speeds, dependence on methods that require temporal diversity, wherever possible, should be reduced. In Weerackody, full spatial diversity is achieved with two transmitter antennas, at the cost, however, of doubling the resources used (either a 100% increase in bandwidth or number of required spreading codes per user). These extra resources limit the overall efficiency of the system.
With closed-loop beamforming, the channel characteristics are measured and the gain and phase of the signals applied to each element in an antenna array are modified to create an antenna pattern that maximizes the power delivered to the mobile station. A disadvantage of this method is the need for constant measurement and feedback of the channel characteristics and the subsequent recalculation of the adaptive array weights used to modify signals for each antenna element. The time needed to measure and compute the weights limits the speed at which the antenna pattern may be modified to compensate for a changing channel. When a mobile station travels at a higher speed, the channel changes at a rate that is higher than the rate of compensation in the adaptive antenna array. Thus, the feedback loop in the adaptive array or beamforming technique cannot keep up with a quickly changing channel between the base station and a high-speed mobile station.
From the above, it becomes apparent that beamforming is desirable when the mobile station is moving into low speeds and orthogonal or space time transmit diversity (STTD) or variations thereof is desirable when the mobile station is moving at high speeds.
Therefore, it is apparent that there is a need for an improved method of transmitting and receiving a traffic channel using technique from both beamforming and orthogonal transmit diversity.
SUMMARY OF THE INVENTION
There is disclosed a duplex communication system having multiple antennae at the forward link transmitter. One method of transmitting a stream of information symbols from the antennae is by beamforming. With beamforming the transmitter typically operates in closed loop and uses channel information from the receiver to change beams in the forward link. Another approach employs orthogonal coding. Orthogonal coding can be simpler to implement because it can operate in an open loop system that is without channel knowledge at the transmitter. Each has its advantages and disadvantages. What is here disclosed is a method which is an alternative to using only beamforming or orthogonal coding. The signals transmitted from at least two antennae are by beamforming or orthogonal coding; or by beamforming in combination with orthogonal coding in a proportion that is determined by a reference value which is related to the differences between the signals from the antennae. The reference value can be related to the amplitude or phase of the signals and it can be either measured or estimated



BRIEF DESCRIPTION OF THE DRAWINGS
The features, aspects and advantages of the present invention will become better understood with regard to the following description, appended claims, and accompanying drawings where:
FIG. 1 is a block diagram of structure in accordance with the principles of the invention; and
FIG. 2 is a flowchart illustrating the process of producing antenna element signals in accordance with the principles of the invention.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
Beamforming and orthogonal space-time coding (such as space time transmit diversity (STTD) or a variant of STTD) are two methods being studied for transmission using multiple antennas due to the potentially significant diversity and/or array gains that can be obtained. With beamforming, the signals transmitted by the different antennae differ only by a complex scaling factor, designed such that the signals add constructively at the intended receiver. With orthogonal space-time coding, the signals transmitted by the different antennae are orthogonal, in order to allow their independent demodulation.
Beamforming and orthogonal coding are representative of two very different methods used for multiple antenna transmission. Beamforming relies completely on correct channel knowledge at the transmitter whereas orthogonal coding ignores any channel information the transmitter may have. In practice, the transmitter often has some instantaneous or average knowledge of the channel, in which case both these strategies are sub-optimal. A better transmission strategy as is here disclosed for the first time is to combine both orthogonal coding and beamforming in a proportion that is best suited for a particular transmission scenario.
The new method here disclosed, which is an alternative to using only beamforming or orthogonal coding, is to combine beamforming with orthogonal coding in a proportion that depends on the amount of correct channel knowledge at the transmitter. To achieve this desired result, there is here disclosed a family of space-time block codes, for transmitting with two or more transmit antennas, that generate variations of the correlation between the signals transmitted by the different transmit antennas. Disclosed here are methods to encode and decode the signals, and the method to choose the appropriate correlations between the signals.
Beamforming can be of two kinds: open-loop and closed-loop. In closed loop, which is also called closed-loop transmit diversity or maximal ratio transmission, there is a feedback channel from the receiver to the transmitter that provides instantaneous channel information to the multiple antenna transmitter. The channel information available to the transmitter may be corrupted due to channel estimation error, quantization errors, feedback errors and feedback delay (doppler). Use of pure beamforming in closed-loop systems (as is the usual practice) when channel information is not accurate can severely degrade performance. Such degradation is seen, for instance, in closed-loop systems at high mobile speeds. Pure orthogonal coding, which does not require channel knowledge at the transmitter, is never used in closed loop since that would waste available channel information.
In open loop, there is no feedback from the receiver to the transmitter. Pure beamforming can be used with the help of spatial information gathered from the reverse link in a duplex system (e.g., for beamforming, angle of arrival measurement or channel correlation measurement from the reverse link is used). If the channels from all the transmit antennas are not well-correlated, beamforming provides little gain over orthogonal coding. For low channel correlations, orthogonal coding can even outperform open-loop beamforming.
Both beamforming and orthogonal coding are instances of the general technique of space-time coding. In each of the above cases, it is clear that a space-time code that combines beamforming and orthogonal coding in an appropriate proportion will outperform each. To achieve this, there is here disclosed a new space-time block code that allows variation of the signal correlation matrix, which is comprised of the correlations between the signals transmitted by the different antennas. If the correlation between the signals transmitted from different antennae is chosen to be zero, it corresponds to orthogonal coding. If the magnitude of the normalized correlation between the signals is chosen to be 1, then it corresponds to pure beamforming. This allows the transmission to gracefully transition between beamforming and orthogonal coding by varying the desired correlation matrix, based on the amount of reliable channel knowledge the transmitter has at any time. Embodiments of the encoder and decoder here disclosed are modifications of an STTD encoder and decoder, respectively.
In the reference “Combining transmit beamforming and orthogonal space-time coding by utilizing side information,” by G. Jongren et al., in IEEE Sensor Array and Multichannel Signal Processing Workshop, pp. 153-157, 2000, there is proposed a scheme to combine beamforming and orthogonal space-time block codes using a different approach than that disclosed in this invention. In the Jongren et al reference, the code is parameterized by a complex matrix that minimizes pair-wise error probability of the code, and is computed using computationally intensive convex optimization via interior point methods. In contrast, in this invention, the block coding scheme is parameterized by one or more correlation coefficients that are determined using a look-up table from simple measurements made on the channel, as described in the description that follows. Also, the Jongren et al reference requires the complex matrix to be made known to the receiver, which is not required by the scheme proposed here.
The description below is applied to a wireless digital communications system wherein the transmitter transmits a sequence of complex-valued information symbols via N transmit antennas. The information symbols represent voice, data or any other form of information that is required to be communicated to the wireless receiver. The signals transmitted from the N antennas are transformed by transmission channels that exist between the transmit antennas and the receiver. The transmission strategy of this invention is to encode the stream of information symbols to be transmitted into N streams of encoded symbols that are transmitted by the respective antenna elements. Such encoding is generally known as space-time coding, and the present invention specifies a particular encoding and decoding method that enables effective communication to take place when the transmitter has imperfect knowledge of the transmission channel.
Referring to FIG. 1, there is illustrated a wireless communication system 8 which can be used to implement an embodiment of the method of the invention having two transmit antennas (N=2). The wireless communication system 8 includes base transmitter 10 which transmits signals via antennas 15, 18 to subscriber unit 20. It is to be noted that, in FIG. 1, only the forward link of the communications system is shown where the system may also include a reverse link when there is duplex operation. A reverse link may also be required to provide a feedback loop for data and commands for operating the forward link in an adaptive array mode.
Referring to FIG. 2, in step 80, the separate symbols of the stream of serial data on input line 9 is formed into blocks of n symbols at the front end of space-time encoder 12. Thereafter, each block of symbols is encoded with an orthogonal code to form code matrix B0 in step 82 (see relationship (9)). In step 84, the correlation coefficient λ is used to compute the transformation matrix L. It is to be noted that a single correlation coefficient λ will normally be used when there are more than two antennas. In step 86 the orthogonal code matrix B0 is multiplied with the transformation L to obtain B. L is any matrix which satisfies the relationship

Φ=LH·L.

Stated in words, Φ is the desired correlation matrix and is equal to the conjugate transpose of L multiplied by L. In step 88, the signals of B are applied to different antennae in space and time.
The base transmitter 10 includes traffic channel 9 which is typically a serial data stream source of user data grouped into blocks of symbols each containing two symbols such as, for example, voice signals or data signals such as facsimile data, documents, software and the like.
The traffic channel 8 is coupled to space-time encoder 12. The space-time encoder is coupled to receive complex-valued weights w1, w2 , . . . , wN, which are shown in FIG. 1 for N=2 as w1 and w2. The beamformer weights are normalized to satisfy the equation

|w1|2+|w2|2+ . . . +|wN|2=1.  (1)

One or more correlation coefficients are fed to the space-time encoder 12. In the embodiment with two transmit antennas (N=2), depicted in FIG. 1, there is a single correlation coefficient (λ) that is fed to the space-time encoder 12. The space-time encoder modifies and converts the traffic channel 9 into N parallel traffic channels which are amplified by 22 and transmitted by the N transmit antennas. FIG. 1 shows the two output channels of the encoder, 18 and 20, when N=2.
The operation of the space-time encoder 12 is now described. The encoder first encodes a block of M symbols to generate an orthogonal code matrix B0, whose column vectors are orthogonal to each other. A transformation matrix L is also generated where L is any solution of the equation LHL=Φ, where Φ is the desired correlation matrix of the multiple antenna signals with N rows and N columns. Stated differently, the transformation matrix L is a matrix such that, when the conjugate transpose of L is multiplied by L a desired correlation matrix Φ is generated. The element in the ith row and jth column of the correlation matrix Φ is the desired correlation of the signal transmitted by the ith antenna with the signal transmitted by the jth antenna. Multiplication of the matrix B0 with the transformation matrix L generates the code matrix B=B0L whose columns are the signals transmitted by the different antennas. The element in the ith row and jth column of the matrix B is the signal transmitted by the ith antenna in the jth time interval.
This procedure is better explained by describing the embodiment shown in FIG. 1 for N=2 transmit antennas. In this embodiment, the block length M is also equal to 2, and the orthogonal code B0 is given by the known STTD code, which is an equivalent variation of the Alamouti code. The block of M=2 information symbols are denoted by s1 and s2, and the STTD code is given by the matrix




  
    
      
        
          B
          0
        
        =
        
          [
          
            
              
                
                  s
                  1
                
              
              
                
                  -
                  
                    s
                    2
                    *
                  
                
              
            
            
              
                
                  s
                  2
                
              
              
                
                  s
                  1
                  *
                
              
            
          
          ]
        
      
    
    
      
        (
        2
        )
      
    
  




The signal correlation matrix Φ is defined in terms of the correlation coefficient λ and beamformer weights w1 and w2 as




  
    
      
        Φ
        =
        
          
            [
            
              
                
                  
                    
                      (
                      
                        1
                        +
                        λ
                      
                      )
                    
                    |
                    
                      w
                      1
                    
                    ⁢
                    
                      |
                      2
                    
                    ⁢
                    
                      +
                      
                        (
                        
                          1
                          -
                          λ
                        
                        )
                      
                    
                    |
                    
                      w
                      2
                    
                    ⁢
                    
                      |
                      2
                    
                  
                
                
                  
                    2
                    ⁢
                    λ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      w
                      1
                      *
                    
                    ⁢
                    
                      w
                      2
                    
                  
                
              
              
                
                  
                    2
                    ⁢
                    λ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      w
                      1
                    
                    ⁢
                    
                      w
                      2
                      *
                    
                  
                
                
                  
                    
                      (
                      
                        1
                        +
                        λ
                      
                      )
                    
                    |
                    
                      w
                      1
                    
                    ⁢
                    
                      |
                      2
                    
                    ⁢
                    
                      +
                      
                        (
                        
                          1
                          =
                          λ
                        
                        )
                      
                    
                    |
                    
                      w
                      2
                    
                    ⁢
                    
                      |
                      2
                    
                  
                
              
            
            ]
          
          .
        
      
    
    
      
        (
        3
        )
      
    
  




The final code matrix is designed as

B=B0L,  (4)

where L is the transformation matrix, which is any of the several possible solutions to the equation LHL=Φ. Any of these solutions can be used in designing the transformation matrix L. One such solution is given by





  
    
      
        L
        =
        
          [
          
            
              
                
                  
                    
                      1
                      +
                      λ
                    
                  
                  ⁢
                  
                    w
                    1
                  
                
              
              
                
                  
                    
                      1
                      +
                      λ
                    
                  
                  ⁢
                  
                    w
                    2
                  
                
              
            
            
              
                
                  
                    
                      1
                      -
                      λ
                    
                  
                  ⁢
                  
                    w
                    2
                    *
                  
                
              
              
                
                  
                    -
                    
                      
                        1
                        -
                        λ
                      
                    
                  
                  ⁢
                  
                    w
                    1
                    *
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        5
        )
      
    
  




For this embodiment of the transformation matrix L, the space-time encoder 12 applies the signals to the two antennas in the two time intervals according to Table 1. The same encoding procedure is applied to the next block of two symbols, and so forth.










TABLE 1







Time 1
Time 2


















Antenna 1




  
    
      
        1
        +
        λ
      
    
    ⁢
    
      w
      1
    
    ⁢
    
      s
      1
    
  
  -
  
    
      
        1
        -
        λ
      
    
    ⁢
    
      w
      2
      *
    
    ⁢
    
      s
      2
      *
    
  








  
    
      
        1
        -
        λ
      
    
    ⁢
    
      w
      2
      *
    
    ⁢
    
      s
      1
      *
    
  
  +
  
    
      
        1
        +
        λ
      
    
    ⁢
    
      w
      1
    
    ⁢
    
      s
      2
    
  






 


Antenna 2




  
    
      
        1
        +
        λ
      
    
    ⁢
    
      w
      2
    
    ⁢
    
      s
      1
    
  
  +
  
    
      
        1
        -
        λ
      
    
    ⁢
    
      w
      1
      *
    
    ⁢
    
      s
      2
      *
    
  








  
    
      -
      
        
          1
          -
          λ
        
      
    
    ⁢
    
      w
      1
      *
    
    ⁢
    
      s
      1
      *
    
  
  +
  
    
      
        1
        +
        λ
      
    
    ⁢
    
      w
      2
    
    ⁢
    
      s
      2
    
  













A different solution of the equation LHL=Φ yields a different relationship for L and consequently a space-time code that is different from the embodiment described above. An example of such a code is when L is the matrix square root solution, which yields a matrix L such that LH=L and is given by




  
    
      
        L
        =
        
          
            [
            
              
            
            ⁢
            
              
                
                  
                    
                      
                        1
                        +
                        λ
                      
                    
                    |
                    
                      w
                      1
                    
                    ⁢
                    
                      |
                      2
                    
                    ⁢
                    
                      +
                      
                        
                          1
                          -
                          λ
                        
                      
                    
                    |
                    
                      w
                      2
                    
                    ⁢
                    
                      |
                      2
                    
                  
                
                
                  
                    
                      
                        1
                        +
                        λ
                      
                    
                    -
                    
                      
                        
                          1
                          -
                          λ
                        
                      
                      ⁢
                      
                        w
                        1
                        *
                      
                      ⁢
                      
                        w
                        2
                      
                    
                  
                
              
              
                
                  
                    
                      
                        1
                        +
                        λ
                      
                    
                    -
                    
                      
                        
                          1
                          -
                          λ
                        
                      
                      ⁢
                      
                        w
                        1
                      
                      ⁢
                      
                        w
                        2
                        *
                      
                    
                  
                
                
                  
                    
                      
                        1
                        -
                        λ
                      
                    
                    |
                    
                      w
                      1
                    
                    ⁢
                    
                      |
                      2
                    
                    ⁢
                    
                      +
                      
                        
                          1
                          -
                          λ
                        
                      
                    
                    |
                    
                      w
                      2
                    
                    ⁢
                    
                      |
                      2
                    
                  
                
              
            
            ]
          
          ⁢
          
            
          
          .
        
      
    
    
      
        (
        6
        )
      
    
  




This choice of L results in an encoder that applies the signals given in Table 2. These or other solutions of LHL=Φ can be used to design the encoder.











TABLE 2







Time 1
Time 2


















Antenna 1




  
    
      
        
          
            (
            
              
                
                  
                    1
                    +
                    λ
                  
                
                ⁢
                
                  
                    
                    
                      w
                      1
                    
                    
                  
                  2
                
              
              +
              
                
                  
                    1
                    +
                    λ
                  
                
                ⁢
                
                  
                    
                    
                      w
                      2
                    
                    
                  
                  2
                
              
            
            )
          
          ⁢
          
            s
            1
          
        
        -
      
    
  
  
    
      
        
          
            1
            +
            λ
          
        
        -
        
          
            
              1
              -
              λ
            
          
          ⁢
          
            w
            1
          
          ⁢
          
            w
            2
            *
          
          ⁢
          
            s
            2
            *
          
        
      
    
  








  
    
      
        
          
            
              
                
                  
                    (
                    
                      
                        
                          1
                          +
                          λ
                        
                      
                      -
                      
                        
                          1
                          -
                          λ
                        
                      
                    
                    )
                  
                  ⁢
                  
                    
                      
                      
                        w
                        2
                      
                      
                    
                    2
                  
                
                )
              
              ⁢
              
                w
                1
              
              ⁢
              
                w
                2
                *
              
              ⁢
              
                s
                2
                *
              
            
            +
          
        
      
      
        
          
            (
            
              
                
                  1
                  +
                  λ
                
              
              -
              
                
                  
                    1
                    -
                    λ
                  
                
                ⁢
                
                  
                    
                    
                      w
                      1
                    
                    
                  
                  2
                
              
              +
            
          
        
      
      
        
          
            
              
                
                  
                    1
                    -
                    λ
                  
                
                ⁢
                
                  
                    
                    
                      w
                      2
                    
                    
                  
                  2
                
              
              )
            
            ⁢
            
              s
              2
            
          
        
      
    
     
  
   






 


Antenna 2




  
    
      
        
          
            
              (
              
                
                  
                    1
                    +
                    λ
                  
                
                -
                
                  
                    1
                    -
                    λ
                  
                
              
              )
            
            ⁢
            
              w
              1
              *
            
            ⁢
            
              w
              2
            
            ⁢
            
              s
              1
            
          
          -
        
      
    
    
      
        
          
            (
            
              
                
                  
                    1
                    -
                    λ
                  
                
                ⁢
                
                  
                    
                    
                      w
                      1
                    
                    
                  
                  2
                
              
              +
              
                
                  
                    1
                    +
                    λ
                  
                
                ⁢
                
                  
                    
                    
                      w
                      2
                    
                    
                  
                  2
                
              
            
            )
          
          ⁢
          
            s
            2
            *
          
        
      
    
  
   








  
    
      
        
          
            
              (
              
                
                  
                    
                      1
                      +
                      λ
                    
                  
                  ⁢
                  
                    
                      
                      
                        w
                        1
                      
                      
                    
                    2
                  
                
                +
                
                  
                    
                      1
                      +
                      λ
                    
                  
                  ⁢
                  
                    
                      
                      
                        w
                        2
                      
                      
                    
                    2
                  
                
              
              )
            
            ⁢
            
              s
              1
              *
            
          
          +
        
      
    
    
      
        
          (
          
            
              
                1
                +
                λ
              
            
            -
            
              
                
                  1
                  -
                  λ
                
              
              ⁢
              
                w
                1
                *
              
              ⁢
              
                w
                2
              
              ⁢
              
                s
                2
              
            
          
        
      
    
  
   













The transmission scheme described above combines the strategies of beamforming and orthogonal coding. The code correlation coefficient λ is a coefficient that can be used by the transmitter to control the relative amounts of beamforming and orthogonal coding that are applied. When λ=0, then the above embodiment of the transmission scheme with n=2 is similar to orthogonal coding using a modified Alamouti code. (See “A simple transmitter diversity scheme for wireless communications,” by S. Alamouti, IEEE Journal on Selected Areas in Communications, pp. 1451-1458, October 1998; and “Transmitter diversity technique for wireless communications,” U.S. Pat. No. 6,185,258 B1, by S. Alamouti and Tarokh. When λ=1, then the transmission scheme is similar to beamforming. Smaller values of the code correlation coefficient λ means that the transmission scheme includes both beamforming and orthogonal coding but is weighted toward orthogonal coding, and larger values of λ means that the transmission scheme includes both beamforming and orthogonal coding but is weighted toward beamforming. A large value of λ should be chosen when confidence is high at the transmitter on the correctness of the beamformer weights (w1 and w2 in the embodiment described above). The beamformer weights in turn depend on the knowledge that the transmitter has about the channel. A small value of λ should be chosen when there is little confidence at the transmitter about the correctness of the beamformer weights. For instance, in a closed loop transmit diversity system in mobile communications, λ could be made to be close to 1 when the mobile speed is low and there is reliable feedback of beamforming weights from the mobile receiver to the transmitter. At high mobile speeds when the feedback information is not reliable, λ can be made to be close to 0 so that orthogonal coding is implemented, which does not rely on feedback information. The code correlation coefficient can be optimally selected for any given communications scenario. An example of optimal design of λ is to minimize the probability of symbol or bit error at the receiver subject to a constraint on the transmit power. Another possible method of selecting an optimal λ is to minimize the transmit power subject to a constraint on the probability of error at the receiver.
The correlation parameter selector 14 of FIG. 1 determines the value of λ in an open-loop downlink system having at least two antennae. Initially, measurements of the uplink channel are made at the downlink multiple antenna transmitter using one of the known channel estimation schemes such as, for example, the pilot signals on the uplink. The measurements obtained are used to determine the correlation coefficient ρ between the channels received by the two antennae. The transmitter then selects a value of λ from a look up table. The look up table contains a list of the optimal values of λ for each value of the channel correlation coefficient ρ and is created and stored at the transmitter prior to the intended communication. The table can be designed to minimize bit or frame error rate for a given power constraint, or to minimize transmit power to achieve a bit or frame error rate requirement.
The encoded symbols are transmitted over the transmit antennas after multiplication with spreading code (if any) and frequency up-shifting by a carrier signal in 22. Assuming frequency
non-selective fading channels between the transmit 24, 26 and receive 28 antennae, the signal received from a particular transmitter antenna is the signal transmitted by the antenna multiplied by a complex channel gain. For example, where N=2, the channel gains from the first and second transmitter antennae are denoted as h1 and h2, respectively. The block of encoded symbols at times 1 and 2, as described above, are received, after despreading as baseband signal vector r, where




  
    
      
        r
        =
        
          
            [
            
              
                
                  
                    r
                    1
                  
                
              
              
                
                  
                    r
                    2
                  
                
              
            
            ]
          
          =
          
            
              
                B
                0
              
              ⁢
              L
              ⁢
              
                
              
              ⁢
              h
            
            +
            
              n
              .
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




In the above relationship, h=[h1h2]T and is the channel gain vector (which includes transmitted signal amplitude), n=[n1n2]T and is the noise vector, and B0 is the orthogonal code matrix described above.
Equation (7) for the received signal can be rearranged and written as

r=B0hλ+n,  (8)

where hλ is the “virtual” channel gain vector that is given by the relationship





  
    
      
        
          
            h
            λ
          
          =
          
            
              [
              
                
                  
                    
                      h
                      λ1
                    
                  
                
                
                  
                    
                      h
                      λ2
                    
                  
                
              
              ]
            
            =
            Lh
          
        
        ,
      
    
    
      
        (
        9
        )
      
    
  




where L is the transformation matrix applied at the transmitter, as described above. It is clear from the above model for the received signal that, to the receiver, the received signal appears to be coming from a multiple antenna transmitter that transmits orthogonal signals using the orthogonal hλ. Therefore, the receiver that is used to demodulate signals transmitted using the orthogonal code B0 can also be used to demodulate the signals transmitted using the proposed space time code, by replacing the true channel estimates with estimates of the virtual channel. Since the embodiment shown in FIG. 1 uses the STTD orthogonal code, the receiver 30 is comprised of the STTD decoder 24 in conjunction with a virtual channel estimator 23 which computes estimates of the virtual channel hλ from the received signal.

In one embodiment of the virtual channel estimator 23, the dedicated pilot symbols, which are symbols known at the receiver that are embedded into the transmitted information symbols and are also encoded using the same code, are used. If the dedicated pilot symbols are encoded this way, the known method of estimating the channel using a pilot for the STTD code directly yields the required estimate of the virtual channel vector.
Another embodiment of 23 to estimate the virtual channel is to estimate the true channel h using any of the methods commonly used for channel estimation, and estimate the code coefficient λ, and use these two estimates to compute an estimate of the virtual channel by using the relation hλ=Lh. In this embodiment, the true channel estimation can be reliably performed using the common pilot symbols that are not encoded with the proposed code. The value of λ can either be explicitly signalled to the receiver by the transmitter via the forward data link, or can be estimated at the receiver by using, for example, the dedicated pilot on the downlink. Estimation of λ at the receiver can be performed using the same look-up table method used in the correlation coefficient selector 14, along with estimation of the channel coefficients at the receiver, both in open and closed loop. The computation of λ in this embodiment is therefore performed in a manner identical to the selection of λ at the transmitter by 14, except that no adjustment of time delay needs to be made at the receiver in closed loop.
The proposed transmission technique can also be used in conjunction with multiple antennae at the receiver, in a manner similar to the multiple antenna reception of orthogonal coded signals.
Having a control on the amount of beamforming and orthogonal coding is useful in the special case of scheduled transmission for high speed data. In scheduled transmissions, the transmitter transmits a burst of data at a high data rate during the times when it estimates that the channel gain is large. It is beneficial in this case to perform more beamforming than orthogonal coding. Therefore, one method to improve scheduled transmission is to select a larger value of λ during these bursts of high data rate transmission than the λ that would be chosen for non-scheduled transmission.
While various embodiments of the invention have been described, it should be apparent that variations and alternative embodiments can be implemented in accordance with the invention. It is to be understood, therefore, that the invention is not to be in any way limited except in accordance with the spirit of the appended claims and their equivalents.

## Claims

1. A method of transmitting signals from at least two first antennae to at least one second antenna comprising the steps of:
determining at least one first coefficient based upon information indicative of at least two first signals received by the at least two first antennae, said at least one first coefficient being indicative of at least one correlation between the first signals, said at least two first signals being transmitted from said at least one second antenna; and
determining at least one second coefficient based on the first coefficient, said at least one second coefficient indicating weights applied to at least two second signals to be transmitted, respectively, by said at least two first antennae, the weights indicating relative amounts of orthogonal coding and beamforming to be used for transmitting said at least two second signals.

2. The method of claim 1, wherein the step of determining said at least one first coefficient comprises determining at least one amplitude correlation coefficient based on at least one pilot signal transmitted by said at least one second antenna.

3. The method of claim 1, wherein the step of determining said at least one first coefficient comprises determining at least one phase correlation coefficient based on at least one pilot signal transmitted by said at least one second antenna.

4. The method of claim 1, wherein the step of determining said at least one first coefficient comprises determining at least one correlation between the first signals based on at least one pilot signal transmitted by said at least one second antenna.

5. The method of claim 1, wherein the step of determining said at least one second coefficient based on the first coefficient comprises selecting a proportion of orthogonal coding relative to a proportion of beamforming used for transmitting.

6. The method of claim 1, wherein said at least one first coefficient varies between a first level and a second level.

7. The method of claim 6, wherein a value of said at least one first coefficient being equal to the first level results in selecting beamforming for transmitting and wherein the value of said at least one correlation coefficient being equal to the second level results in selecting orthogonal coding for transmitting.

8. The method of claim 7, wherein the value of said at least one first coefficient having a level between the first and second levels results in selecting both beamforming and orthogonal coding for transmitting.

9. The method of claim 7, wherein the value of said at least one first coefficient determines the proportion of beamforming relative to orthogonal coding used for transmitting.

10. The method of claim 7,wherein the value of said at least one first coefficient being at a level that is closer to the first level results in more beamforming than orthogonal coding used for transmitting.

11. The method of claim 7, wherein the value of said at least one first coefficient being at a level that is closer to the second level results in more orthogonal coding than beamforming used for transmitting.

12. The method of claim 7, wherein the value of said at least one first coefficient relative to the first and second reference levels determines the relative amounts of beamforming relative to orthogonal coding used for transmitting.