Abstract:
A Process for selecting a Precoding Matrix Index (PMI) in a Multiple In Multiple Out (MIMO) receiver of a wireless communications comprising a base station communicating with User Equipments through a downlink and uplink channel, said base station applying a precoding on the transmit symbol vector based on a matrix Pi being selected from a set of predefined matrices and identified by a PMI index computed by said UE and forwarded to said base station via said uplink; said process involving step of: —estimating ( 100 ) the MIMO channel matrix H of a given set of resources blocks comprising received symbol vectors; —estimating ( 200 ) the variance σ 2  of the additive noise (AWGN)—computing ( 300 ) for each particular matrix comprised within said set of predefined matrix a cost function Fi (Pi, H, σ 2   n ) being representative of the orthogonality of said matrix MIMO channel matrix H; —comparing ( 400 ) the values of said cost function Fi; and —transmitting ( 500 ) to said base station the index i corresponding to the Fi representative of the best conditionned MIMO channel matrix.

Description:
TECHNICAL FIELD 
       [0001]    The invention relates to the field of wireless communications and more particularly to a process for performing the selection of a Precoding Matrix Index (PMI) for a MIMO receiver using near-ML detection, such as Lattice Reduction Aided (LRA) mecanism, and a receiver for doing the same. 
       BACKGROUND ART 
       [0002]    Spatial multiplexing is a common scheme for Multiple-In-Multiple-Out (MIMO) communication systems lying on the transmission over different antennas of independent information streams. 
         [0003]    Spatial multiplexing is conventionally combined with precoding which improves the ergodic capacity of the resulting transmission channel.  FIG. 1  particularly illustrates the example of a 2×2 MIMO communication—composed of a downlink  1  and an uplink  2 —between a base station  10  and a mobile equipment, such as an User Equipment. 
         [0004]    Considering base station  10 , the latter includes a channel coding block  11  providing two independent data streams to a MIMO Precoder  12  which applies a precoding precoding based on one particular matrix W selected from a codebook           of matrices known at both the base station  10  and the UE  20 , before conveying such data streams over two transmit antennas  13  and  14 . 
         [0005]    On the other side, UE  20  includes two receiving antennas  23  and  24  which generate the received streams which are then forwarded to a MIMO detector performing symbols detection following channel estimation. Generally speaking, the detection may be based on either a linear near-ML detector, as illustrated in  FIG. 2 , or a non-linear near-ML (near Maximum-Likehood) detection such as Sphere Decoders. 
         [0006]    In the partiuclar case of a closed-loop system, the detector is associated with Precoding Matrix Index block  22  which is arranged to compute one particular value of an index which is conveyed to the transmitting base station  10  through uplink  2  so that the latter can uniquely selects one advantageous matrix W to be used in the precoding process. 
         [0007]    At this point, the closed-loop system model reads simultaneously: 
         [0000]    
       
      
       y=HWx+n=Hpx+n={tilde over (H)}pz+n  
      
     
         [0008]    with x being the transmit symbol vector withdrawn from a finite and known constellation, y being the receive symbol vector, H being the channel matrix, W being the precoding matrix and n being an additive White gaussian noise (AWGN) of varience σ 2   n . The effective channel matrix reads HW. 
         [0009]    The concept of precoding in spatial multiplexing systems raises two main issues: 
         [0010]    The first issue—which is only mentioned here for the sake of clarity and which will not be considered in the present application—consists in the design the set           given a chosen selection criterion. Such issue is particularly addressed in the following prior art reference (3): 
         [0011]    The second issue—which is particularly addressed in the present application—consists in the determination of an advantageous precoding matrix from a codebook           through an appropriate selection criterion. 
         [0012]    One conventional technique is known in the art and designated as the so-called Capacity-Selection Criterion (C-SC), which is recommended by 3GPP is described in reference 3GPP TS 36.211 V9.1.0 (2010-03), Technical Specification, 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Channels and Modulation, (Release 9). 
         [0013]    The conventional C-SC technique is particularly adapted to the use of a Minimum Mean Square Estimation (MMSE) detector and clearly optimal for such MMSE detector. 
         [0014]    Basically, in such C-SC prior art technique, the index selection is based on the SINR maximization with the knowledge of any precoding matrix and the estimation of the channel matrix in reception, and reads: 
         [0000]    
       
         
           
             
               
                 
                   SINR 
                   k 
                 
                  
                 
                   ( 
                   
                     W 
                     , 
                     H 
                   
                   ) 
                 
               
               = 
               
                 
                   1 
                   
                     
                       ( 
                       
                         I 
                         + 
                         
                           
                             1 
                             
                               σ 
                               n 
                               2 
                             
                           
                            
                           
                             P 
                             H 
                           
                            
                           
                             H 
                             H 
                           
                            
                           HP 
                         
                       
                       ) 
                     
                     
                       k 
                       , 
                       k 
                     
                     
                       - 
                       1 
                     
                   
                 
                 - 
                 1 
               
             
             , 
           
         
       
     
         [0000]    where ν 2   n  is the noise variance, and under the assumption of normalized power constellations. 
         [0015]    In the particular case of a 2×2 MIMO system, the expression above rewrites—for the first layer: 
         [0000]    
       
         
           
             
               
                 
                   SINR 
                   0 
                 
                  
                 
                   ( 
                   
                     W 
                     , 
                     H 
                   
                   ) 
                 
               
               = 
               
                 
                   
                      
                     
                       U 
                       00 
                     
                      
                   
                   2 
                 
                 
                   
                     
                        
                       
                         U 
                         01 
                       
                        
                     
                     2 
                   
                   + 
                   
                     
                       σ 
                       n 
                       2 
                     
                      
                     
                       
                          
                         
                           B 
                           00 
                         
                          
                       
                       2 
                     
                   
                   + 
                   
                     
                       σ 
                       n 
                       2 
                     
                      
                     
                       
                          
                         
                           B 
                           01 
                         
                          
                       
                       2 
                     
                   
                 
               
             
             , 
           
         
       
     
         [0000]    where 
         [0000]        U =( H   P   H   H   P +σ n   2   I ) −1   H   P   H   H   P  
 
         [0016]    The Capacity-Selection Criterion (C-SC) consists in choosing w such that: 
         [0000]        W =arg max w     i     εw {Σ k SINR k ( W   i   ,H )}.
 
         [0017]    While the C-SC technique is the optimal in the case of the widely spread linear MMSE detector,—because of the maximization of the capacity which results—it should be noticed that such technique is less advantageous in the case of a more elaborated and sophisticated decoding technique, such as based on a non linear technique, such as achieved by a near-Maximum Likehood detection. 
         [0018]    Indeed, thanks to its level of sophistication, a near-Maximum Likehood technique already achieves a high degree of capacity given a channel and, in such situation, the known Capacity-Selection Criterion (C-SC) index selection which is recommended by the 3GPP shows limited interest. 
         [0019]    The technical problem to be solved by the present invention is to design a new index selection mechanism which is more adapted to the high efficiency of a near-ML decoder, such as a decoder using a Lattice Reduction technique. 
       SUMMARY OF THE INVENTION 
       [0020]    It is an object of the present invention to provide a precoding process for a MIMO communication system, which is adapted to the use of a near-ML receiver involving a Lattice reduction process. 
         [0021]    It is a further object of the present invention to provide an alternative index selection process to be used in a closed loop precoding technique which fully fits a Lattice-Reduction Aided decoding process. 
         [0022]    It is another object of the present invention to significantly reduces the complexity of a MIMO receiver based on a lattice reduction mechanism. 
         [0023]    It is still another object of the present invention to achieve a MIMO LRA detector which is combined with an enhanced precoding index selection mechanism which can be used in a closed loop precoding technique of a MIMO communication system. 
         [0024]    These and other objects of the invention are achieved by means of a PMI selection process which involves the steps of: 
         [0025]    considering the provided MIMO channel matrix estimation H of a given set of resources blocks comprising received symbol vectors; 
         [0026]    computing for each particular matrix comprised within said set of predefined matrix a cost function Fi (Wi, H,) being representative of the orthogonality of said matrix MIMO channel matrix H; 
         [0027]    comparing the values of said cost function Fi; and 
         [0028]    transmitting to said base station the index i corresponding to the Fi representative of the best conditionned MIMO channel matrix. 
         [0000]    In one embodiment, the cost function Fi (Wi, H,) is based on the condition number.
 
Preferrably, the cost function Fi (Wi, H, σ 2   n ) is based on the orthogonal deficiency of said MIMO channel matrix, defined as follows:
 
         [0000]    
       
         
           
             
               o 
                
               
                   
               
                
               
                 d 
                  
                 
                   ( 
                   WH 
                   ) 
                 
               
             
             = 
             
               1 
               - 
               
                 
                   det 
                    
                   
                     ( 
                     
                       
                         H 
                         H 
                       
                        
                       H 
                     
                     ) 
                   
                 
                 
                   
                     ∏ 
                     
                       i 
                       = 
                       1 
                     
                     
                       n 
                       T 
                     
                   
                    
                   
                       
                   
                    
                   
                     
                        
                       
                         WH 
                         i 
                       
                        
                     
                     2 
                   
                 
               
             
           
         
       
     
         [0000]    In one embodiment, the process is used in an OFDM receiver supporting MIMO spatial-multiplexing mode, such as IEEE 802.16, IEEE 802.11, 3GPP LTE and 3GPP LTE-A.
 
In one particular embodiment, the receiver is a 2×2 MIMO receiver or a 4×2 MIMO receiver.
 
         [0029]    The invention also achieves a receiver for a Multiple-In Multiple-Out (MIMO) wireless communications system comprising a base station communicating with User Equipments through a downlink and uplink channels. The base station applies a precoding on the transmit symbol vector, which precoding is based on a matrix Wi selected from a set of predefined matrices known at both the base station and the UE. 
         [0030]    The computation of the PMI index is based on the use of a cost function which is representative of the orthogonality of the matrix so as to focus the precoding applied by the base station for the purpose of reducing the complexity of the lattice reduction step to be performed within the mobile equipment with limited resources and latency. 
         [0000]    More particularly, the index returned by the mobile to the base station in the closed loop is computed by means of a comparison of a cost function Fi (Wi, H), where Fi is representative of the orthogonality, or the conditionning of the matrix channel H.
 
In one particular embodiment, the cost function is based on the use of the orthogonal deficiency (od) defined as follows:
 
         [0000]    
       
         
           
             
               o 
                
               
                   
               
                
               
                 d 
                  
                 
                   ( 
                   WH 
                   ) 
                 
               
             
             = 
             
               1 
               - 
               
                 
                   det 
                    
                   
                     ( 
                     
                       
                         H 
                         H 
                       
                        
                       H 
                     
                     ) 
                   
                 
                 
                   
                     ∏ 
                     
                       i 
                       = 
                       1 
                     
                     
                       n 
                       T 
                     
                   
                    
                   
                       
                   
                    
                   
                     
                        
                       
                         WH 
                         i 
                       
                        
                     
                     2 
                   
                 
               
             
           
         
       
     
         [0000]    The invention finally achieves a UE comprising a OFDM receiver supporting MIMO spatial-multiplexing mode, such as IEEE 802.16, IEEE 802.11, 3GPP LTE and 3GPP LTE-A. 
     
    
     
       DESCRIPTION OF THE DRAWINGS 
         [0031]    Other features of one or more embodiments of the invention will be best understood by reference to the following detailed description when read in conjunction with the accompanying drawings. 
           [0032]      FIG. 1  illustrates an example of a 2×2 MIMO communication with a base station  10  communicating with a mobile, such as a User Equipment  20 . 
           [0033]      FIG. 2  recalls the general principle of a LR-Aided detection block diagram 
           [0034]      FIG. 3  illustrates the Cumulative Density Function (CDF) of the Orthogonal Deficiency (OD), for both a 2×2 (a) and a 4×2 (b) MIMO precoding schemes and a given SNR of 0 dB 
           [0035]      FIG. 4  illustrates the Cumulative Density Function (CDF) of the Orthogonal Deficiency (OD), for both a 2×2 (a) and a 4×2 (b) MIMO precoding schemes and a given SNR of 20 dB 
           [0036]      FIG. 5  illustrates the CDF of the OD, for both a 2×2 (a) and a 4×2 (b) MIMO precoding schemes and a given SNR of 20 dB, in the case of multiple precoding schemes associated to both a LLL Algorithm-based and a Seysen Algorithm-based Lattice Reductions. 
           [0037]      FIG. 6  shows the Uncoded BER as a function of SNR, in the case of a complex 2×2 MIMO channel, by considering MMSE, LA-Aided MMSE and ML detectors, and with QPSK modulations on each layer 
           [0038]      FIG. 7  illustrates the Uncoded BER as a function of SNR, in the case of a complex 4×2 MIMO channel, by considering MMSE, LA-Aided MMSE and ML detectors, and with QPSK modulations on each layer. 
           [0039]      FIG. 8  illustrates one embodiment of a process for selecting a PMI index for a closed loop precoding technique. 
       
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0040]    The process which will be described hereinafter can be embodied in a wide number of applications. Clearly, any OFDM standard supporting MIMO spatial-multiplexing mode, e.g. IEEE 802.16, IEEE 802.11, 3GPP LTE and 3GPP LTE-A, can take advantage of the process described below. 
         [0041]    More particularly, the invention is particularly advantageous in the case of a large number of antennas and consequently in the case of the 3GPP LTE-A standard. 
         [0042]    The process which will be described below with details is particularly useful for decreasing the complexity of a Lattice Reduction-Aided (LRA) detector which achieves high efficiency. 
         [0043]    Indeed, it has been discovered by the inventors that Lattice Reduction-Aided (LRA) detection can be advantageously combined with a closed loop precoding technique, associated with one new Precoding Matrix Index (PMI) selection criterion having the effect of improving the conditionning of the channel matrix in the perspective of the LRA computation. 
         [0044]    To achieve this, the PMI selection mechanism is non longer based on the computation of the SINR (as in the conventional Capacity-Selection Criterion (C-SC)), but is based on a new parameter which is representative of the conditioning of the channel matrix, in other words its orthogonality. 
         [0045]    In one particular, embodiment, the PMI selection mechanism is based on the so-called Orthogonal Deficiency parameter which shows great interest since it is strongly cheaper to compute than the condition number. 
         [0046]    Therefore, a significant reduction of both the mean and maximal computational complexity of the LR mechanism can be expected and near-optimal detector performance can be achieved at an expected polynomial computational cost in CL case. 
         [0047]    As presented in the following, both LA and SA computational complexity UBs can be decreased with an appropriate selection criterion. 
         [0048]    For the sake of clarity, theoretical considerations of the LRA mechanism will be introduced (I), prior to the description of one particular embodiment of a process of selection of the PMI to be used in a closed loop precoding technique. 
       I. Theoretical Considerations on Lattice Reduction Aided Detection Techniques 
       [0049]    The optimal Maximum Likelihood (ML) detector can be efficiently approximated by the use of several techniques such as Lattice Reduction Aided detectors (linear or not), commonly referred as near-ML techniques. These detection schemes have been widely studied in the Open-Loop (OL) case, in term of computational complexity and performance while the CL case has been neglected. In term of uncoded Bit Error Rate (BER) performance, the LRA techniques have been shown to be near-optimal for a polynomial computational complexity. 
         [0050]    Various LR algorithms have been proposed. In this patent proposal, the popular Lenstra-Lenstra-Lovász (LLL) Algorithm (LA) [2] and the more recent Seysen Algorithm (SA) [2] have been considered. 
         [0051]    While it classically reads: y=Hx+n, where xε           n     T    and yε           n     R    denote the system input and output respectively, Hε           n     R     ×n     T    the channel matrix and nε           n     R    the AWGN, the equivalent system model can then be rewritten: 
         [0000]    
       
      
       y={tilde over (H)}z+n  
      
     
         [0000]    Any Lattice Reduction (LR)-Aided (LRA) detector principle lies in the consideration of a reduced channel matrix {tilde over (H)}=HT. Consequently, the introduction of the transformed signal Z=T −1 x, where {tilde over (H)}ε          denotes the reduced lattice generator matrix and Tε           n     T     ×n     T    the transformation matrix that has to be unimodular by definition, offers an advantage in the use of classical linear equalizers. In order to further introduce the useful vocabulary, the notation           is defined as the set of complex integers such that          =         +          with i 2 =−1, and the vector X is withdrawn independently from a Quadrature Amplitude Modulation (QAM)ξ.
 
By discrediting in a first time any precoding step at the transmitter, let us only consider the LRA detectors problematic in reception. In particular, the simplified block-diagram of a LRA-Zero Forcing (ZF) is depicted in  FIG. 2 .
 
In  FIG. 2 , (•) †  denotes the pseudo-inverse,
 
         [0000]    
       
         
           
             
               Q 
               
                 Z 
                 Z 
                 
                   n 
                   T 
                 
               
             
              
             
               { 
               . 
               } 
             
           
         
       
     
         [0000]    the quantization operation to the n T -th dimensional integer lattice, Q ξ   n     T    {•} the mapping of the estimates onto the corresponding symbols belonging to the ξ n     T    constellation and {tilde over (x)} the estimation of the transmit signal. 
         [0052]    In order to quasi-achieve the full diversity in reception, various LR algorithms have been proposed. Let us evoke the optimal (the orthogonality is maximized) but with exponential computational complexities Minkowski and Korkine-Zolotareff algorithms. It has been shown that these solutions are only feasible in the 2×2 MIMO case, which does not match with LTE requirements. As an alternative, the widely popular LA can approach the optimal performance while having a polynomial complexity in mean [2]. More recently, the SA has been presented as an alternative that offers better performances but for a higher computational complexity [2]. 
         [0053]    The LA transforms an input basis H into a LLL-reduced basis {tilde over (H)}. It consists in a local approach that lies on satisfying two conditions of orthogonality and norm reduction, respectively: 
         [0000]    
       
         
           
             
               
                 ℜ 
                  
                 
                   { 
                   
                     μ 
                     
                       i 
                       , 
                       j 
                     
                   
                   } 
                 
                  
                 ℜ 
                  
                 
                   { 
                   
                     μ 
                     
                       i 
                       , 
                       j 
                     
                   
                   } 
                 
               
               ≤ 
               
                 1 
                 2 
               
             
             , 
             
               ∀ 
               
                 1 
                 ≤ 
                 j 
                 &lt; 
                 i 
                 ≤ 
                 
                   n 
                   T 
                 
               
             
             , 
             
               
 
             
              
             where 
           
         
       
       
         
           
             
               
                 μ 
                 
                   i 
                   , 
                   j 
                 
               
               = 
               
                 
                   〈 
                   
                     
                       H 
                       i 
                     
                     , 
                     
                       
                         H 
                         ~ 
                       
                       j 
                     
                   
                   〉 
                 
                 
                   
                      
                     
                       
                         H 
                         ~ 
                       
                       j 
                     
                      
                   
                   2 
                 
               
             
             , 
             and 
           
         
       
       
         
           
             
               
                 
                    
                   
                     
                       H 
                       ~ 
                     
                     i 
                   
                    
                 
                 2 
               
               = 
               
                 
                   ( 
                   
                     δ 
                     - 
                     
                       
                          
                         
                           μ 
                           
                             i 
                             , 
                             
                               i 
                               - 
                               1 
                             
                           
                         
                          
                       
                       2 
                     
                   
                   ) 
                 
                  
                 
                   
                      
                     
                       
                         H 
                         ~ 
                       
                       
                         i 
                         - 
                         1 
                       
                     
                      
                   
                   2 
                 
               
             
             , 
             
               ∀ 
               
                 1 
                 &lt; 
                 i 
                 ≤ 
                 
                   n 
                   T 
                 
               
             
             , 
           
         
       
     
         [0054]    where δ, with 
         [0000]    
       
         
           
             
               
                 1 
                 2 
               
               &lt; 
               δ 
               &lt; 
               1 
             
             , 
           
         
       
     
         [0000]    is a factor selected to achieve a good performance/quality trade-off [4]. The parameter is chosen as 
         [0000]    
       
         
           
             
               δ 
               = 
               
                 3 
                 4 
               
             
             , 
           
         
       
     
         [0000]    as commonly suggested, and {tilde over (H)} i ={tilde over (H)} i −Σ j=1   i−2 {[μ i,j ]H j }. For sake of vocabulary, a basis that respects the condition (1) is said to be Lovász δ—reduced and the condition (3) is said to size-reduced.
 
The SA consists in a global approach that lies on the minimization of the Seysen orthogonality measure:
 
         [0000]        s ( {tilde over (H)} )=Σ i−1   n     T     ∥{tilde over (H)}   i ∥ 2   ∥{tilde over (H)}   i   # ∥ 2 ,
 
         [0000]    Both the LA and the SA have been briefly presented, their performance and subsequently their BER performance with many detectors have been introduced in several publications and make the LA algorithm more convenient for implementation than the SA. Consequently, the LA is particularly considered in the following of the patent proposal and some algorithmic details such as some optimizations will be further presented. 
         [0055]    Let us introduce the QR Decomposition (QRD) of H that reads H=QR, where the matrix Q ε           n     R     ×n     T    has orthonormal columns and Rε           n     T     ×n     T    is an upper-triangular matrix with real diagonal entries. It has been shown that the QRD outputs of H are possible starting points for the LA, and it has been introduced [2] that the Sorted QRD (SQRD) provides better starting points since it finally leads to a significant reduction of the mean computational complexity and of the corresponding variance. Also, another classical result consists in directly considering the complex LA that offers an average complexity saving of nearly 50% compared to the straightforward real model system extension with negligible performance loss. This algorithm will be considered, unless otherwise indicated. 
         [0056]    Through these points, the computational complexity Upper Bound (UB) has been shown [2] to be distinguished between the pre-processing step: 
         [0000]        C   SQRD =10 n   R   n   T   2 −4 n   R   n   T −1.5 n   T   2 +1.5 n   T ,
 
         [0000]    and the two conditions defined in (1) and (2), namely: 
         [0000]        C   ortho =18 n   T −10,
 
         [0000]        C   norm =28( n   R   +n   T )+16, 
         [0000]    that are performed a k number of iterations times. 
         [0057]    This is the key point since its estimation is a difficult task. In particular, the number of iterations depends on the condition number of the channel matrix [5] and is consequently unbounded. Nevertheless, the expected k (and consequently the expected total computational complexity) has been shown to be polynomial: 
         [0000]    
       
         
           
             
               E 
                
               
                 { 
                 k 
                 } 
               
             
             ≤ 
             
               
                 n 
                 T 
                 2 
               
               ( 
               
                 
                   
                     
                       log 
                       δ 
                     
                      
                     
                       ( 
                       
                         
                           n 
                           T 
                         
                         
                           
                             n 
                             R 
                           
                           - 
                           
                             n 
                             T 
                           
                           + 
                           1 
                         
                       
                       ) 
                     
                   
                   + 
                   
                     2.240 
                     
                       
                         log 
                         e 
                       
                        
                       t 
                     
                   
                   + 
                   
                     n 
                     T 
                   
                 
                 , 
               
             
           
         
       
     
         [0000]    by defining E{•} as the expectation and where. 
         [0058]    As a conclusion, the worst-case computational complexity in the Open Loop (OL) case is exponential in the number of antennas. This restrictive aspect may be overstepped though the consideration that the computational complexity in mean is polynomial in the number of antennas. This way, a thresholded version of the algorithm offers convenient results. 
         [0059]    Any modification or consideration aiming at bounding the computational complexity of any LR algorithm is essential for supporting the interest of all a family of LRA detectors. 
       II. Description of One Particular Process 
       [0060]    It will now be described with reference to  FIG. 8 , one particular embodiment of a process for selecting the PMI index to be reported in uplink to the base station. 
         [0061]    The process starts with a step  100  wherein the MIMO channel matrix H is estimated. Generally speaking, channel estimation is well known by the skilled man and will not be further elaborated. It suffices to recall that the estimation of the channel is based on the use of so-called reference signals (or pilots) which, when periodically transmitted—allows the User Equipment (UE) for performing the estimation of the channel matrix. 
         [0062]    Furthermore, it should be noticed that the channel estimation can be performed on one particular Resource block or, alternatively, on a sequence of consecutive resources blocks in accordance with different parameters. 
         [0063]    Then, in a step  200 , the process proceeds with the computation, for each particular matrix comprised within said set of predefined matrix (assumed to be known at both the base station and the UE), a cost function Fi (Wi, H), depending on the channel (estimated in step  100 ) and any tested precoding matrix (Wi). 
         [0064]    Step  200  thus entails the computation of a sequence of Fi values, with i varying from 1 to N (assuming that the given codebook comprises N distinctive matrices). 
         [0065]    In the conventional so-called Capacity-Selection Criterion (C-SC), it is the Signal to Interference plus Noise Ratio SNRi—depending on Wi, H, σ 2   n —which is computed for each particular matrix composing the codebook, and the selection of the higher value of the SINRi returns the value of the index corresponding to the maximal capacity. 
         [0066]    The invention deviates from such known mechanism (and particularly recommended by the 3GPP standard) by using a different cost function which advantageously combine with a LRA based MIMO receiver, the new cost function only depending on H and Wi—more particularly depends on W i H—and no longer being related to the signal to noise ratio. 
         [0067]    The new cost function which is proposed as an alternative to the recommended standard SNRi mechanism, is now based on a parameter which is closely related to the orthogonality of the matrix HW i , such as for instance the condition number. In particular, the cost function is chosen so as to be maximized or minimized with the orthogonality of the matrix HW i    
         [0068]    However, it should be noticed that the condition number is generally complex to compute and requires a significant amount of digital processing resources. 
         [0069]    In one very advantageous embodiment, the process uses a different cost functions, is which is based on the so-called Orthogonal Deficiency (od) which is a parameter defined in Algebra and also representative of the orthogonality of the matrix WH. 
         [0000]    
       
         
           
             
               o 
                
               
                   
               
                
               
                 d 
                  
                 
                   ( 
                   WH 
                   ) 
                 
               
             
             = 
             
               1 
               - 
               
                 
                   det 
                    
                   
                     ( 
                     
                       
                         H 
                         H 
                       
                        
                       H 
                     
                     ) 
                   
                 
                 
                   
                     ∏ 
                     
                       i 
                       = 
                       1 
                     
                     
                       n 
                       T 
                     
                   
                    
                   
                       
                   
                    
                   
                     
                        
                       
                         WH 
                         i 
                       
                        
                     
                     2 
                   
                 
               
             
           
         
       
     
         [0000]    since the general expression (WH) H  WH=HW H WH clearly rewrites H H H, due to the unitary criterion in the codebook design. 
         [0070]    The od parameter is easier to compute than the condition number, thus reducing complexity of the receiver. 
         [0071]    When the process has completed the computation of the cost function for all matrices included in the predefined codebook, the process then proceeds to a step  300  wherein the value of the cost function Fi showing the best conditionning is being determined. 
         [0072]    In the particular case of the Orthogonal Deficiency, the process proceeds with the determination, in step  300 , of the minimum value among all values of Odi (HW i ) being computed. 
         [0073]    Once identified, the process proceeds to a step  400  wherein the corresponding index is returned to the base station through uplink  2  for the purpose of determining the proper precoding matrix to be used by the latter base station. 
         [0074]    The Cumulative Density Function (CDF) of the od is depicted in  FIG. 3  in the OL case, and in the CL case for both ML-SC and C-SC in a 2×2 (a) and a 4×2 (b) MIMO precoding schemes. 
         [0075]    It can be noticed that an appropriate precoding bounds strictly below 1 the od of the effective channel in the case of a 4×2 MIMO system, by noting that the bound depends of the used codebook and of the selection criterion. 
         [0076]    As depicted in  FIG. 5  (left), there is no more bounding of the od strictly below 1 in 2×2 MIMO precoding scheme, i.e. its maximal value by definition is reached. Also, it must be noted that the od bounds depend on the SNR in the C-SC case only. 
         [0077]    Another promising point lies in the observation that this bound does not depend on the SNR in the case of the ML-SC, which offers an advantage over Sphere Decoding-like techniques. In particular: 
         [0000]        od ( HW )≦0.84
 
         [0078]    Since the od criterion and the condition (1) in the LLL-based LR algorithm (namely the orthogonality criterion) are closely linked, the skilled man would expect that a precoding step prior to the LR step would induce a promising computational complexity reduction, at least in mean. 
       III. Simulation Results 
       [0079]    The CDF of the od is depicted in  FIG. 5  in the OL case, and in the CL case for both ML-SC and C-SC and both LA and SA for a complex 2×2 (a) and a 4×2 (b) MIMO precoding schemes. 
         [0080]      FIG. 5  aims at showing that the precoding step not only offers a computational complexity reduction of the LR algorithm. The performance in term of od is also improved compared to the OL case, which shows the interest of associating both LR and precoding that are two different while complementary steps. 
         [0081]    More accurate considerations are offered in Table 1, where the expected and maximum computational complexities for both LA and SA are given for 10 6  Monte-Carlo simulations, keeping in mind that LA as well as SA is independent of SNR (only of the channel realization). Results are given with the following hypothesis: a real product requires 1 MUL, a real addition requires 0 MUL, a real division requires 16 MUL and a real square root requires 32 MUL. 
         [0000]    
       
         
               
             
               
               
               
               
             
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Mean and maximum computational complexities in OL, CL C-SC  
               
               
                 and CL ML-SC cases, in a complex 2x2 MIMO case. 
               
             
          
           
               
                   
                 OL 
                 CL C-SC 
                 CL ML-SC 
               
             
          
           
               
                   
                 mean 
                 max 
                 mean 
                 max 
                 mean 
                 max 
               
               
                   
               
             
          
           
               
                 CLA 
                 223 
                 1225 
                 165 
                 1224 
                 227 
                 1226 
               
               
                 SA 
                 1373 
                 3200 
                 1233 
                 3200 
                 1381 
                 3200 
               
               
                   
               
             
          
         
       
     
         [0082]    For the LA, the computational complexity gain compared to the OL case is 26% and 0% in mean for C-SC and ML-SC respectively. For the SA, the gain is 10% and 0% in mean for C-SC and ML-SC respectively. There is no gain for the algorithm UB for both LA and SA and whatever the SC, which is consistent to aforementioned highlights. Consequently, there is no advantage in the use of a precoding step concerning the LR computational complexity with the 2×2 MIMO precoding scheme. 
         [0083]    In  FIG. 5 , uncoded BER performances are plotted for both OL and CL with the appropriate SC as a function of the SNR, with 10 7  Monte-Carlo simulations per SNR value. The figure depicts the ML detector and the MMSE equalizer as references. These classical performance results are compared to the LRA MMSE Extended [1] equalizer performance. 
         [0084]    It can be observed that the LRA detection schemes achieve full diversity in both OL and CL with a SNR offset that depends on the employed detector. 
         [0085]    Similarly to what has been previously done, the expected and maximum computational complexities for both LA and SA are given in Table 2 for 10 6  Monte-Carlo simulations. 
         [0000]    
       
         
               
             
               
               
               
               
             
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 Mean and maximum computational complexities in OL, CL C-SC  
               
               
                 and CL ML-SC cases, in complex 4x2 MIMO case. 
               
             
          
           
               
                   
                 OL 
                 CL C-SC 
                 CL ML-SC 
               
             
          
           
               
                   
                 mean 
                 max 
                 mean 
                 max 
                 mean 
                 max 
               
               
                   
               
             
          
           
               
                 LA 
                 223 
                 1226  
                 159 
                 509 
                 176 
                 746 
               
               
                 SA 
                 1373 
                 3200 
                 971 
                 1856 
                 1079 
                 2304 
               
               
                   
               
             
          
         
       
     
         [0086]    For the LA, the computational complexity gain compared to the OL case is 29% and 21% in mean for C-SC and ML-SC respectively. For the SA, the gain is 29% and 21% in mean for C-SC and ML-SC respectively. 
         [0087]    For the LA, the computational complexity UB gain compared to the OL case is 58% for the C-SC. For the SA, the UB gain is 42% for the C-SC. Consequently, there is an advantage in the use of a precoding step on the LR computational complexity 2×2 MIMO precoding scheme with the 4×2 MIMO precoding scheme; the UB has been importantly decreased, which is an essential aspect for implementation that confirms that the LRA detectors offers promising perspectives in the achievement of near-optimum performances for a low computational complexity. 
         [0088]    In  FIG. 7 , uncoded BER performances are plotted for both the OL and the CL with the appropriate SC as a function of the SNR, with 10 7  Monte-Carlo simulations per SNR value. The figure depicts the ML detector and the MMSE equalizer as references. These classical performance results are compared to the LRA MMSE Extended equalizer performance. 
         [0089]    It can be seen that the LRA detection schemes achieve full diversity in both OL and CL with a SNR offset that depends on the employed detector. The precoding interest in term of performance is particularly visible is this case due to the increased channel capacity. 
         [0090]    The main advantage in the use of LRA techniques, to which this invention relates, relies in providing quasi-optimal detection performances and an advantage over competition.
       While the expected computational complexities of all the aforementioned classical LR algorithms has been shown to be significantly decreased, the main advantage of the invention lies in exhibiting the maximal computational complexity decrease with the 4×2 MIMO precoding scheme;   It is an essential aspect for the hardware calibration that can be done more advantageously in CL, with no performance loss, and with a reduced complexity;       
 
         [0093]    The LRA detectors offers promising perspectives in the achievement of near-optimum performances for a reduced computational complexity 
       REFERENCES 
       [0000]    
       
         [1] D. Wuebben, R. Boehnke, V. Kuhn, and K.-D. Kammeyer, “Near-maximum-likelihood detection of mimo systems using mmse-based lattice reduction”. vol. 2, pp. 798-802, 2004. 
         [2] L. Barbero, T. Ratnarajah, and C. Cowan, “A comparison of complex lattice reduction algorithms for mimo detection”,  Acoustics, Speech, and Signal Processing, International Conference on , pp. 2705-2708, 2008. 
         [3] D. Love, and R. Heath. “Limited feedback unitary precoding for spatial multiplexing systems”,  Information theory, IEEE Transactions on, vol.  51, no. 8, pp. 2967-2976, 2005. 
         [4] A. K. Lenstra, H. W. Lenstra, and L. Lovàsz, “Factoring polynomials with rational coefficients”,  Mathematische Annalen , vol. 261, no. 4, pp. 515-534, December 1982. 
         [5] J. Jaldén, D. Seethaler, and G. Matz, “Worst-And Average-Case Complexity of LLL Lattice Reduction in MIMO Wireless Systems”,  Acoustics, Speech, and Signal Processing, International Conference on , pp. 2685-2688, 2008. 
         [6] E.-U. Technical Specification Group RAN, “36.101 User Equipment (UE) radio transmission and reception v8.8.0,” Tech. Rep., September 2009.