Abstract:
A spatial channel state information (CSI) feedback technique is incorporated into multiple-input multiple-output mobile communications technologies. Spatial channel state information is measured at receiving equipment and then decomposed into components. The components are then quantized using codebook(s) and fed back as multiple indices to transmitting equipment.

Description:
PRIORITY 
     Priority is claimed to U.S. Provisional Patent Application No. 61/282,275, filed Jan. 12, 2010, the disclosure of which is incorporated herein by reference in its entirety. 
    
    
     FIELD OF THE INVENTION 
     The field of the present invention pertains to providing spatial channel state information (CSI) for mobile communication enhanced by multiple-input multiple-output technologies. 
     BACKGROUND 
     Multiple-input multiple-output (MIMO) is a family of techniques that utilize multiple antennas at the transmitter or at the receiver, or at both the transmitter and the receiver, to exploit the spatial dimension in order to improve data throughput and transmission reliability. The data throughput can be increased by either spatial multiplexing or beamforming. 
     Spatial multiplexing allows multiple data streams to be transmitted simultaneously to the same user through parallel channels in the MIMO setting, especially for diversity antennas where spatial correlation between antennas (both at the transmitter and the receiver) is low. Beamforming helps to enhance the signal-to-interference-plus-noise ratio (SINR) of the channel, thereby improving the channel rate. Such SINR improvement is achieved by proper weighting over multiple transmit antennas. The weight calculation can be based on either long-term measurement (e.g., open-loop) or via feedback (e.g., closed-loop). Closed-loop transmit weighting is often called precoding in the context of MIMO study. 
       FIG. 1  illustrates a precoded MIMO for a single user (SU) where M data streams, u 1 , . . . , u M , are spatially multiplexed by exploiting the M by N spatial channel matrix H. Since the number of transmitter antennas N is greater than the number of receiver antennas M, precoding is applied which is denoted as the matrix F. 
     Precoded MIMO can also be operated in multi-user MIMO (MU-MIMO) mode to further improve the sum rate across multiple users sharing the same time and frequency resource.  FIG. 2  illustrates a two-user MU-MIMO where beamforming (e.g., precoding) is used to spatially separate the two users (and improving SINR), while for each user the two data streams (light shaded and dark shaded) are spatially multiplexed. 
     MU-MIMO, especially the downlink MU-MIMO, is a hot topic in Third Generation Partnership Project (3GPP) Long Term Evolution-Advanced (LTE-Advanced) study as described in 3GPP TR 36.814, v1.1.1, “Further Advancements for E-UTRA, Physical Layer Aspects,” June 2009. MU-MIMO may further enhance the data throughput of LTE systems. The Work Item of DL MU-MIMO was created in 3GPP Physical Layer Working Group (RAN1). 
     A key specification-impacting aspect of precoded MIMO is the spatial CSI feedback required for closed-loop precoding. The spatial channel matrix H as seen in  FIG. 1  contains the complete spatial CSI. Alternatively, an N-by-N covariance matrix R, represented as
 
R=H H H  (1)
 
can provide sufficient spatial information for transmitter precoding where the superscript “H” denotes the complex conjugate. In general, it is too costly to feed back the floating-point version of H or R, which usually contains quite a number of complex coefficients in each frequency band. Quantization is therefore needed to make the feedback more efficient.
 
     A codebook, known to both the receiver and the transmitter, is often used for CSI quantization so that only a codeword index is fed back. The codeword can be selected to either maximize the channel capacity or minimize the distance between the floating-point CSI and the quantized CSI. 
     Codebook design itself is a research-rich topic since a good codebook has to efficiently span the entire relevant spatial space. In that sense, generic codebooks are seldom efficient and, practically, codebooks are tailored to fit different antenna configurations and deployment scenarios. Generally speaking, the more complex the antenna configuration is, the more difficult the codebook design. 
     Table 1 is an excerpt from 3GPP RAN1 LTE standard specification described in 3GPP TS 36.211, “Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Channels and Modulation”. The codebook is used for a very simple MIMO configuration with two transmit and two receiver antennas, M=2 and N=2, as in  FIG. 1 . As such, the maximum number of multiplexed streams (also called the layers) is 2. 
     
       
         
               
             
               
               
             
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 A codebook in LTE specification for 2 × 2 MIMO. 
               
             
          
           
               
                 Codebook 
                 Number of layers υ 
               
             
          
           
               
                 index 
                 1 
                 2 
               
               
                   
               
               
                 0 
                 
                   
                     
                       
                         
                           1 
                           
                             2 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                             
                             
                               
                                 1 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           1 
                           
                             2 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 0 
                               
                             
                             
                               
                                 0 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               
                   
               
               
                 1 
                 
                   
                     
                       
                         
                           1 
                           
                             2 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                             
                             
                               
                                 
                                   - 
                                   1 
                                 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           1 
                           2 
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                             
                               
                                 1 
                               
                               
                                 
                                   - 
                                   1 
                                 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               
                   
               
               
                 2 
                 
                   
                     
                       
                         
                           1 
                           
                             2 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                             
                             
                               
                                 j 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
                 
                   
                     
                       
                         
                           1 
                           2 
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                               
                                 1 
                               
                             
                             
                               
                                 j 
                               
                               
                                 
                                   - 
                                   j 
                                 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
               
               
                   
               
               
                 3 
                 
                   
                     
                       
                         
                           1 
                           
                             2 
                           
                         
                         ⁡ 
                         
                           [ 
                           
                             
                               
                                 1 
                               
                             
                             
                               
                                 
                                   - 
                                   j 
                                 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                 
                 — 
               
               
                   
               
             
          
         
       
     
     Compared to single-user MIMO (SU-MIMO), multi-user MIMO (MU-MIMO) requires more accurate spatial CSI feedback in order to perform effective spatial separation and multiplexing operations. As a result, the CSI feedback and the codebook design in MU-MIMO are more challenging. 
     In mathematics, a Kronecker product, denoted by            , is an operation on two matrices of arbitrary size resulting in a block matrix. For example,
     
       
         
           
             
               
                 
                   
                     A 
                     ⊗ 
                     B 
                   
                   = 
                   
                     
                       [ 
                       
                         
                           
                             
                               
                                 a 
                                 11 
                               
                               ⁢ 
                               B 
                             
                           
                           
                             … 
                           
                           
                             
                               
                                 a 
                                 
                                   1 
                                   ⁢ 
                                   n 
                                 
                               
                               ⁢ 
                               B 
                             
                           
                         
                         
                           
                             ⋮ 
                           
                           
                             ⋱ 
                           
                           
                             ⋮ 
                           
                         
                         
                           
                             
                               
                                 a 
                                 
                                   m 
                                   ⁢ 
                                   
                                       
                                   
                                   ⁢ 
                                   1 
                                 
                               
                               ⁢ 
                               B 
                             
                           
                           
                             … 
                           
                           
                             
                               
                                 a 
                                 mn 
                               
                               ⁢ 
                               B 
                             
                           
                         
                       
                       ] 
                     
                     . 
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
     The Kronecker product has been used in codebook design, for example for cross-polarization antennas described in 3GPP, R1-094752, “DL codebook design for 8Tx MIMO in LTE-A,” ZTE, RAN#59, Jeju, South Korea, November 2009 More specifically, the codebook is constructed by a Kronecker product of a LTE Rel-8 codebook and a unitary 2-by-2 matrix. Note that the idea described in 3GPP, R1-094752, “DL codebook design for 8Tx MIMO in LTE-A,” ZTE, RAN#59, Jeju, South Korea, November 2009 is to have a single codebook and the feedback is still a single index of the codebook. 
     As described in 3GPP, R1-094844, “Low-overhead feedback of spatial covariance matrix,” Motorola, RAN1#59, Jeju, South Korea, November 2009, a Kronecker product can be used for decomposing a bigger transmit covariance matrix R into two smaller matrices R ULA  and R Pol , so that the feedback overhead can be reduced:
 
R=R Pol             R ULA   (3).

     The above decomposition also works in the eigen-domain by applying the mixed-product property of a Kronecker product 
                         R   =       ⁢       R   Pol     ⊗     R   ULA                   =       ⁢       [       V   Pol     ⁢     D   Pol     ⁢     V   Pol   H       ]     ⊗     [       V   ULA     ⁢     D   ULA     ⁢     V   ULA   H       ]                   =       ⁢         [       V   Pol     ⊗     V   ULA       ]     ⁡     [       D   Pol     ⊗     D   ULA       ]       ⁡     [       V   Pol   H     ⊗     V   ULA   H       ]                     (   4   )               
where matrices “V xx ” contain the eigen-vectors of the transmit covariance matrices “R xx ”, respectively. Diagonal matrices “D xx ” contain the eigen-values of the transmit covariance matrices “R xx ”.
 
     A key thing to point out is that the design principle of CSI feedback described in 3GPP, R1-094844, “Low-overhead feedback of spatial covariance matrixm,” Motorola, RAN1#59, Jeju, South Korea, November 2009 is to directly quantize the transmit covariance matrices, element-by-element wise. Such an approach is drastically different from the codebook-based quantization mentioned previously. So, even after Kronecker decomposition, the content of the feedback is still covariance matrix (or matrices), rather than codebook index (or indices). 
     SUMMARY OF THE INVENTION 
     The present invention is directed toward wireless communication methods and systems which provide accurate spatial CSI feedback for MIMO operation, while keeping the feedback overhead as low as possible. 
     In these methods and systems, spatial channel state information is measured at receiving equipment, resulting in CSI. In some embodiments, the CSI is on a channel matrix or a covariance matrix and may further be quantized through the use of codebooks. 
     The CSI is decomposed, resulting in component CSIs. Each component CSI may represent characteristics of beamforming antennas or cross-polarization antennas. Beamforming antennas may further be represented as a uniform linear array (ULA). 
     In some embodiments, decomposition is by using a Kronecker product. Moreover, decomposition of a covariance matrix may include applying the mixed-product property of a Kronecker product. 
     The component CSIs are further quantized using codebook(s), resulting indices. The codebook(s) used may be the same or different, and the indices may point to a vector or a matrix in the codebook(s). 
     The indices are fed back to transmitting equipment and an outer product may be calculated. 
     Additional aspects and advantages of the improvements will appear from the description of the preferred embodiment. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       Embodiments of the present invention are illustrated by way of the accompanying drawings, in which: 
         FIG. 1  illustrates a block diagram of precoded SU-MIMO with a minimum mean-squared error (MMSE) receiver; 
         FIG. 2  illustrates a two-user MU-MIMO with two sets of closely-spaced antennas of cross polarizations; 
         FIG. 3  illustrates a feedback setup and a block diagram relevant to the invention; and 
         FIG. 4  illustrates an example of eight transmit antennas composed of beamforming antennas and cross polarization antennas. 
     
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Kronecker decomposition described in 3GPP, R1-094844, “Low-overhead feedback of spatial covariance matrix,” Motorola, RAN1#59, Jeju, South Korea, November 2009 is applied to codebook-based CSI quantization. The approach is particularly suitable for an antenna setting that contains multiple closely-spaced cross-polarization antennas. In such a setting, the spatial correlation statistics of cross-polarization antennas and beamforming antennas are quite different. 
     Appropriate Kronecker decomposition must first be decided for a specific antenna configuration so that different spatial characteristics of different components of antennas can be differentiated. The sizes of component covariance matrices can be different. Then, for each component covariance matrix, an index of the codeword is chosen from an appropriate codebook suitable for the component antenna configuration. 
     The above process is repeated multiple times to find a set of codeword indices for each component covariance matrices that result in the best match between the quantized and the floating-point covariance matrices. The set of codeword indices is fed back to the transmitter. 
     At the transmitter, each quantized version of component covariance matrix is reconstructed by looking up the codeword index in the corresponding codebook. The composite covariance matrix is synthesized by a Kronecker product of all the quantized component covariance matrices. 
     In more detail, a feedback setup and a block diagram relevant to the invention are shown in  FIG. 3 .  FIG. 3  serves as a dual-illustration: one for an entity block illustration and the other for a block diagram of the processes. 
     There are two major entities in the setup: evolved node B (eNB) denotes the base station and user equipment (UE) denotes the mobile device. In this downlink example (data transmission from eNB to UE) the feedback is from UE to eNB. Both eNB and UE have multiple antennas for precoded MIMO. Of particular interest are the configurations where the number of receive antennas at the UE is smaller than the number of transmit antennas at the eNB. 
     Codebooks are known to both eNB and UE, based on the air-interface specifications, and can be a subset of the codebooks specified in the standards. The actual codebooks for each component CSI depend on antenna configurations and the deployment environment, and are usually decided by the network. That information can be notified to the UE via semi-static radio resource control (RRC) signaling. 
     At the UE, spatial CSI is measured first. The measurement can be directly on the channel matrix H, or the covariance matrix R, or other metrics. In certain embodiments of the invention, R is the major interest which can be directly estimated, or post-processed as Equation (1) shows. Here, for the simplicity of presentation, it is assumed that the measured spatial CSI, e.g., R, is of floating-point precision, although the chip implementations often use fixed-point arithmetic. In other words, it is expected that the internal quantization in the chips is much finer than the quantization for the feedback. 
     Once the covariance matrix R is estimated, matrix decomposition can be carried out. To further illustrate the process, an example of eight transmit antennas (N=8) is shown in  FIG. 4 , where there are four antennas in each polarizations (light shaded and dark shaded). On each of the four pairs, the two antennas are mounted along the orthogonal polarization directions, +45/−45 degrees, or the so called—cross-polarizations. The spacing between adjacent beamforming elements is usually half of the wavelength to achieve four-element beamforming. Since the antenna spacing is uniform, such beamforming setting is also called Uniform Linear Array (ULA). 
     In this antenna configuration, high spatial correlation is expected between the four same-polarized antennas, while low spatial correlation is expected between different polarization antennas. Therefore, it is reasonable to decompose the spatial CSI between beamforming antennas and cross-polarization antennas, as Equation (3) shows. More specifically, the 8-by-8 covariance matrix is decomposed into a 4-by-4 component matrix R ULA  and a 2-by-2 component matrix R Pol . 
     Then, for each component covariance matrix, a suitable codebook is used for the quantization. The codeword index can be chosen to minimize the distance between the quantized covariance matrix and the floating-point covariance matrix. For example, the distance can be measured as, 
                     MSE   =       1     N   2       ⁢                ∑     i   =   1     N     ⁢              λ   i          2     ⁢       v   ~     i     ⁢       v   ~     i   H         -     R     ULA   /   Pol              Frobenius   2         ,           (   5   )               
where {tilde over (v)} i  is the i-th quantized eigenvector of the spatial channel H which corresponds to the i-th column of the codeword and |λ i | 2  is the i-th eigenvalue of R ULA  or R Pol . Note that the index can indicate either a vector or a matrix in the codebook.
 
     For the antenna configuration shown in  FIG. 4 , most likely one index indicates a 4-by-1 vector (a codeword) corresponding to R ULA . Mathematically, such 4-by-1 vector can be represented as [1,e j2πθ , e j4πθ , e j6πθ ] T  where θ is determined by the wavelength, the antenna spacing between adjacent ULA elements, and the angle of departure (AoD) of the mobile with respect to the bore-sight of the ULA. The other index indicates a 2-by-1 vector (a codeword) or 2-by-2 matrix (a codeword) corresponding to R Pol . The 2-by-1 vector can be chosen from Table 1 for number of layers=1, for example, in the form of [1, α 1 ] T  if the normalization constant is ignored. The 2-by-2 matrix can be chosen from Table 1 for number of layers=2, for example, in the form of [1, α 1 ;1, α 2 ] T  if the normalization constant is ignored. As such, the spatial CSI feedback would contain two indices. 
     Upon receiving the CSI feedback from the UE, a series of operations are carried out. First, each quantized component CSI, e.g., R ULA  or R Pol , is reconstructed by looking up the fed back index in the corresponding codebook and then doing the outer product, e.g., 
               ∑   i     ⁢              λ   i          2     ⁢       v   ~     i     ⁢         v   ~     i   H     .             
Next, the quantized composite CSI, e.g., R, is derived by the Kronecker product of quantized R ULA  and R Pol . Finally, the quantized composite CSI is used to calculate the precoding matrices.
 
     The above composite spatial CSI reconstruction process at the transmitter can also be pre-processed by combining the codebook for beamforming ULA and the codebook for cross-polarizations. The principle follows Eq. (4) which is Kronecker product of eigen-values for beamforming ULA and cross-polarizations. Specifically, the combining is performed by Kronecker product of the codeword vector or matrix of cross-polarizations, for example, [1, α 1 ] T  or [1, α 1 ;1, α 2 ] T , and the codeword vector of ULA, for example, [1, e j2πθ , e j4πθ , e j6πθ ] T . Each codeword in the combined codebook, while still separately indexed for ULA and cross-polarizations, would take the form such as [1,e j2πθ , e j4πθ , e j6πθ , α 1 , α 1 e j2πθ , α 1 e j4πθ , α 1 e j6πθ ] T  for rank=1, or [1,e j2πθ , e j4πθ , e j6πθ , α 1 , α 1 e j2πθ , α 1 e j4πθ , α 1 e j6πθ α 2 , α 2 e j2πθ , α 2 e j4πθ , α 2 e j6πθ ] T  for rank=2. 
     While embodiments of this invention have been shown and described, it will be apparent to those skilled in the art that many more modifications are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the following claims.