Abstract:
A method of transmission over multiple wireless channels in a multiple antenna system includes storing channel modulation matrices at a transmitter; receiving quantized channel state information at the transmitter from plural receivers; selecting a transmission modulation matrix using the quantized channel state information from the stored channel modulation matrices; and transmitting over the multiple channels to the plural receivers using the selected transmission modulation matrix. In another embodiment, the method includes storing, at one or more receivers, indexes of modulation matrices generated by a capacity enhancing algorithm; upon a selected one of the one or more receivers receiving a transmission from the transmitter, the selected receiver selecting a modulation matrix from the stored modulation matrices that optimizes transmission between the transmitter and the selected receiver; the selected receiver sending an index representing the selected modulation matrix; and receiving the index at the transmitter from the selected receiver.

Description:
CROSS-REFERENCES TO RELATED APPLICATIONS 
       [0001]    This application is a division of U.S. application Ser. No. 11/754,965, filed May 29, 2007, which claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Patent Application No. 60/808,806, filed May 26, 2006, the entire disclosure of which is incorporated herein by reference. 
     
    
     BACKGROUND 
       [0002]    The development of the modern Internet-based data communication systems and ever increasing demand for bandwidth have spurred an unprecedented progress in development of high capacity wireless systems. The major trends in such systems design are the use of multiple antennas to provide capacity gains on fading channels and orthogonal frequency division multiplexing (OFDM) to facilitate the utilization of these capacity gains on rich scattering frequency-selective channels. Since the end of the last decade, there has been an explosion of interest in multiple-input multiple-output systems (MIMO) and a lot of research work has been devoted to their performance limits and methods to achieve them. 
         [0003]    One of the fundamental issues in multiple antenna systems is the availability of the channel state information at transmitter and receiver. While it is usually assumed that perfect channel state information (CSI) is available at the receiver, the transmitter may have perfect, partial or no CSI. In case of the single user systems, the perfect CSI at the transmitter (CSIT) allows for use of a spatial water-filling approach to achieve maximum capacity. In case of multi-user broadcast channels (the downlink), the capacity is maximized by using the so called dirty paper coding, which also depends on the availability of perfect CSIT. Such systems are usually refereed to as closed-loop as opposed to open-loop systems where there is no feedback from the receiver and the transmitter typically uses equal-power division between the antennas. 
         [0004]    In practice, the CSI should be quantized to minimize feedback rate while providing satisfactory performance of the system. The problem has attracted attention of the scientific community and papers provided solutions for beam-forming on flat-fading MIMO channels where the diversity gain is the main focus. Moreover, some authors dealt with frequency-selective channels and OFDM modulation although also those papers were mainly devoted to beamforming approach. 
         [0005]    Unfortunately, availability of full CSIT is unrealistic due to the feedback delay and noise, channel estimation errors and limited feedback bandwidth, which forces CSI to be quantized at the receiver to minimize feedback rate. The problem has attracted attention of the scientific community and papers have provided solutions for single-user beamforming on flat-fading MIMO channels, where the diversity gain is the main focus. More recently, CSI quantization results were shown for multi-user zero-forcing algorithms by Jindal. 
       SUMMARY 
       [0006]    This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter. 
         [0007]    We present a simple, flexible algorithm that is constructed with multiplexing approach to MIMO transmission, i.e., where the channel is used to transmit multiple data streams. We use a vector quantizer approach to construct code-books of water-filling covariance matrices which can be used in a wide variety of system configurations and on frequency selective channels. Moreover, we propose a solution which reduces the required average feedback rate by transmitting the indexes of only those covariance matrices which provide higher instantaneous capacity than the equal power allocation. 
     
    
     
       DESCRIPTION OF THE DRAWINGS 
         [0008]    The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein: 
           [0009]    Embodiments will now be described with reference to the figures, in which like reference characters denote like elements, by way of example, and in which: 
           [0010]      FIG. 1  shows a typical transmission system; 
           [0011]      FIG. 2  is a flow diagram showing basic system operation; 
           [0012]      FIG. 3  is a flow diagram showing use of quantized mode gain in the system of  FIG. 1 ; 
           [0013]      FIG. 4   a  is a flow diagram showing design of optimized orthogonal mode matrices for use in the system of  FIG. 1  for single user case; 
           [0014]      FIG. 4   b  is a flow diagram showing design of optimized orthogonal modes for use in the system of  FIG. 1  for a multi user system; 
           [0015]      FIG. 5  is a flow diagram showing an embodiment of calculation of throughput at the transmitter in the system of  FIG. 1  for single user case; 
           [0016]      FIG. 6  is a flow diagram showing an embodiment of calculation of throughput at the transmitter in the system of  FIG. 1  for multiple user case; 
           [0017]      FIG. 7  is a flow diagram showing design of stored modulation matrices at the transmitter of  FIG. 1  for multiple user case; 
           [0018]      FIG. 8  is a flow diagram showing nested quantization; 
           [0019]      FIG. 9  is a flow diagram showing design of mode gain matrixes for use in the system of  FIG. 1 ; 
           [0020]      FIG. 10  is a flow diagram showing design of power allocation matrices for use at the transmitter of  FIG. 1  for multiple user case; 
           [0021]      FIG. 11  shows the distribution of {circumflex over (V)} and Ŝ in vector codebooks for a 2×2 MIMO system and N V =2 and N S =1. The two orthogonal eigenvectors in each {circumflex over (V)} matrix are shown using the same line style. The X-axis corresponds to the real entries in the first rows of {circumflex over (V)} and the YZ-plane corresponds to the complex entries in the second rows of the matrices. In case of Ŝ, the entries are presented for different power levels P in a normalized form Ŝ/P.  FIG. 11(   a ) shows {circumflex over (V)} for N V =2 and  FIG. 11(   b ) shows Ŝ for N S =1 
           [0022]      FIG. 12  shows (a) ergodic system capacity C and (b) average feedback bit rate R b  for different granularities of channel state information at the transmitter on the flat fading channel. System capacity is shown in logarithmic scale to better illustrate the differences between curves. 
           [0023]      FIG. 13  shows (a) capacity loss and (b) average feedback bit rate R b  on the frequency selective channel. 
           [0024]      FIG. 14  shows sum-rates of cooperative, zero-forcing DPC and linear systems with full CSIT and 10 users with identical receivers. 
           [0025]      FIG. 15  is an example of multi-user interference caused by partial CSIT. 
           [0026]      FIG. 16  is an example of the nested quantization of eigenmodes. The thick lines symbolize centroids {circumflex over (v)}(i) of the respective regions v i .  16 ( a ) shows a coarse 2-bit quantizer and  16 ( b ) a precise 2-bit quantizer of v 3 . 
           [0027]      FIG. 17  shows linear system sum-rates with full CSIT and varying feedback bit-rate for K=2. n T =2 and all users with n R =2 antennas. 
           [0028]      FIG. 18  shows linear system sum-rates with full CSIT and varying feedback bit-rate for K+10. n T =2 and all users with n R =2 antennas. 
           [0029]      FIG. 19  shows linear system sum-rates with full CSIT and nested CSI quantization with varying eigenmode coherence time τ eig  (N v ). n T =2, K=10, n R =2, N s =1 and N v =2,4. 
       
    
    
     DETAILED DESCRIPTION 
       [0030]    One of the fundamental issues in multiple antenna systems is the availability of the channel state information (CSI) at transmitter and receiver [ 24 ]. The perfect CSI at the transmitter (CSIT) enables the use of a spatial water-filling, dirty paper coding and simultaneous transmission to multiple users, allowing the systems to approach their maximum theoretical capacity. Such systems are usually referred to as closed-loop as opposed to open-loop systems where there is no feedback from the receiver. Closed-loop systems enable major increases of system capacities, allowing the operators to multiply their revenue and maintain high quality of service at the same time. 
         [0031]    In this work, we describe a flexible approach to CSI encoding, which can be used to construct the linear modulation matrices for both single-user and multi-user networks. In both cases, the modulation matrices are composed of two independent parts: the eigenmode matrix and the diagonal power division matrix with the sum of entries on the diagonal equal to 1. The system operates as follows:
       1. The receiver(s)[ 24 ] estimate(s) the respective multiple antenna channel(s).   2. Each estimated channel is decomposed using the singular value decomposition (SVD) to form the matrix of eigenmodes[ 3 O] and their respective singular values [ 304 ].   3. If the system works in the single-user mode, all entries in the codebook of transmitter eigenmode modulation matrices[ 32 ] and all entries in the codebook of transmitter power division matrices[ 32 A] are tested at the receiver to choose their combination providing highest instantaneous capacity. The indices of the best transmitter eigenmode and power division matrices are then sent[ 34 ],[ 34 A] back to the transmitter.   4. If the system works in the multi-user mode, all entries in the codebook of receiver eigenmode vectors[ 32 ] and all entries in the codebook of receiver mode gains[ 32 A] are tested at the receiver[ 24 ] for best match with the estimated channel (the matching function can be chosen freely by the system designer). The indices of the best receiver eigenmode and power division matrices[ 94 ] are then sent[ 34 ] back to the transmitter.   5. Based on the received[ 36 ],[ 36 A] indices, the transmitter chooses[ 38 ],[ 52 ],[ 62 ] the modulation matrix and uses it to transmit[ 40 ] the information to one or more users[ 24 ] at a time.       
 
         [0037]    Our proposed method allows to simplify the feedback system by implementing only one set of eigenmode matrices for all values of signal-to-noise ratio (SNR) and a much smaller set of power division matrices that differ slightly for different values of SNR. As a result, the required feedback bit rate is kept low and constant throughout the whole range of SNR values of interest. The additional advantage of the splitting of the modulation matrix into two parts is that it can lower the feedback bit rate for slowly-varying channels. If the eigenmodes of the channel stay within the same region for an extended period of time, additionally, nested encoding can be performed to increase the resolution of the CSIT and improve the system capacity. 
         [0038]    The actual design of the receiver and transmitter eigenmode and power division matrices can be done using numerical or analytical methods and is not the object of this disclosure. However, our method allows for actual implementations of systems closely approaching the theoretical capacities of MIMO channels without putting any unrealistic demand on the feedback link throughput. This is a major improvement compared to the other state-of-the art CSI quantization methods, which experience problems approaching the theoretical capacities and suffer from the early onset of capacity ceiling due to inter-user interference at relatively low SNR. 
       I. System Model for Single User Communication and OFDM 
       [0039]    We assume that the communication system consists of a transmitter equipped with n T  antennas[ 22 ] and a receiver[ 24 ] with n R  antennas[ 26 ]. A general frequency selective fading channel is modeled by a set of channel matrices H j  of dimension n R ×n T  defined for each sub-carrier j=0,1, . . . . N OFDM -1. The received signal at the jth sub-carrier is then given by the n R -dimensional vector y j  defined as 
         [0000]        y   j   =H   j   x   j   +n   j   (1)
 
         [0000]    where x i  is the n T -dimensional vector of the transmitted signal and is the n R -dimensional vector consisting of independent circular complex Gaussian entries with zero mean and variance  1 . Moreover, we assume that power is allocated equally across all sub-carriers |x j | 2 =P. 
       II. Quantizing Water-Filling Information 
       [0040]    If the transmitter has access to the perfect channel state information about the matrix H j , it can select the signaling vector x j  to maximize the closed-loop system capacity 
         [0000]    
       
         
           
             
               
                 
                   C 
                   = 
                   
                     
                       ∑ 
                       j 
                     
                      
                     
                       
                         log 
                         2 
                       
                        
                       
                         det 
                         [ 
                         
                           I 
                           + 
                           
                             
                               H 
                               j 
                             
                              
                             
                               Q 
                               j 
                             
                              
                             
                               H 
                               j 
                               H 
                             
                           
                         
                         ] 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where Q j =E[x j x j   H ]. Unfortunately, optimizing the capacity in (2) requires a very large feedback rate to transmit information about optimum Q j  (or correspondingly H j ) which is impractical. Instead, we propose using a limited feedback link, with the transmitter choosing from a set of matrices {circumflex over (Q)}(n). 
         [0041]    Using the typical approach involving singular value decomposition and optimum water-filling, we can rewrite (1) as 
         [0000]        y   j   =H   j   x   j   +n   j =( U   j   D   j   V   j   H )( V   j   {tilde over (x)}   j )+ n   j   (3)
 
         [0000]    where E[{tilde over (x)} j {tilde over (x)} j   H ]=S j  constrained with Tr (S j )=P is a diagonal matrix describing optimum power allocation between the eigenmodes in V i . Based on (3), the set of matrices Q j =V j S j V j   H , maximizes capacity in (2). 
         [0042]    To construct the most efficient vector quantizer for channel feedback, the straightforward approach would be to jointly optimize signal covariance matrices {circumflex over (Q)} for all sub-carriers at once. Such an approach, however, is both complex and impractical, since any change of channel description and/or power level would render the optimized quantizer suboptimal. Instead, we propose an algorithm which separately quantizes information about eigenmode matrices V j  in codebook {circumflex over (V)} and power allocation S j  in codebook Ŝ. Note that the first variable depends only on channel description and not on the power level P which simplifies the design. 
         [0043]    We optimize the quantizers {circumflex over (V)} and Ŝ for flat-fading case and we apply them separately for each sub-carrier in case of OFDM modulation. Although such an approach is sub-optimal, it allows a large degree of flexibility since different system setups can be supported with the same basic structure. 
         [0044]    A. Quantizing Eigenmodes 
         [0045]    We assume that the receiver[ 24 ] has perfect channel state information (CSIR) and attempts to separate[ 30 ] the eigenmode streams {tilde over (x)} j  in (3) by multiplying y j  with U j   H . However, if the transmitter uses quantized eigenmode matrix set with limited cardinality, the diagonalization of {tilde over (x)} j  will not be perfect. To model this, we introduce a heuristic distortion metric which is expressed as 
         [0000]      γ v ( n;H )=∥ DV   H   {circumflex over (V)} ( n )− D∥   F   (4)
 
         [0000]    where {circumflex over (V)}(n) is the nth entry in the predefined set of channel diagonalization matrices and ∥.∥ F  is the Frobenius norm. We omitted subscript entries j in (4) for the clarity of presentation. 
         [0046]    We assume that n=0,1, . . . 2 N     v   −1 where N v , is the number of bits per channel realization in the feedback link needed to represent the vectors {circumflex over (V)}(n). To design the quantizer using (4), we divide the whole space of channel realizations H into 2 N     v    regions V i  where 
         [0000]        V   i   ={γv ( i;H )&lt;γ v ( j;H )for all  j≠i}.   (5)
 
         [0047]    It can be shown that minimizing this metric should, on average, lead to maximizing the ergodic capacity of the channel with the quantized feedback (when γ(n;H)=0 the channel becomes perfectly diagonalized). The optimum selection of {circumflex over (V)} and regions V i  in (5) is an object of our current work. Here, however, we use a simple iterative heuristic based on a modified form of the Lloyd algorithm, which has very good convergence properties and usually yields good results. The algorithm starts by creating a codebook of centroids {circumflex over (V)} and, based on these results, divides the quantization space into regions V i . The codebook is created as follows: [ 50 ]
       1. Create a large training set of L random matrices H(l).[ 46 ]   2. For each random matrix H(l), perform singular value decomposition to obtain D(l) and V(l) as in (3).   3. Set iteration counter i=0. Create a set of 2 N     v    random matrices Ĥ(n).   4. For each matrix Ĥ(n) calculate corresponding {circumflex over (V)} (i) (n) using singular value decomposition.   5. For each training element H(l) and codebook entry {circumflex over (V)} (i) (n) calculate the metric in (4). For every l choose indexes n opt (l) corresponding to the lowest values of γv(n;H(l)).   6. Calculate a new set {circumflex over (V)} (i+1) (n) as a form of spherical average of all entries V(l) corresponding to the same index n using the following method. (The direct averaging is impossible since it does not preserve orthogonality between eigenvectors.) For all n calculate the subsets L(n)={l:n opt (l)=n} and if their respective cardinalities |L(n)|≠0 the corresponding matrices  Q   (i+1) (n) can be obtained as       
 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         Q 
                         _ 
                       
                       
                         ( 
                         
                           i 
                           + 
                           1 
                         
                         ) 
                       
                     
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                   = 
                   
                     
                       1 
                       
                          
                         
                           L 
                            
                           
                             ( 
                             n 
                             ) 
                           
                         
                          
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           ∈ 
                           
                             L 
                              
                             
                               ( 
                               n 
                               ) 
                             
                           
                         
                       
                        
                       
                         
                           
                             V 
                              
                             
                               ( 
                               l 
                               ) 
                             
                           
                           1 
                         
                          
                         
                           
                             OV 
                              
                             
                               ( 
                               l 
                               ) 
                             
                           
                           H 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 where  1 O is an n T ×n T  all-zero matrix with the exception of the upper-left corner element equal to 1. Finally, using singular value decomposition, calculate {circumflex over (V)} (i+1) (n) from 
               
             
           
         
       
     
         [0000]          Q     (i+1) ( n )= {circumflex over (V)}   (i+1) ( n ) W ( {circumflex over (V)}   (i+1) ( n )) H   (7)
           where W is a dummy variable.       7. Calculate the average distortion metric       
 
         [0000]        γ   v   (i+1) =1/ LΣ   l   γv ( n   opt ( l ); H ( l )).       8. If distortion metric fulfills |  γ   v   (i+1) −  γ   v   (i) |/  γ   v   (i) &lt;Θ, stop. Otherwise increase i by 1 and go to 5).         
         [0058]    Upon completion of the above algorithm, the set of vectors {circumflex over (V)} can be used to calculate the regions in (5). The results of the codebook optimization are presented in  FIG. 11   a ) for a case of n T =n R =2 and N V =2. The optimization was performed using L=1,000·2 N     v    and Θ=10 −7 . 
         [0059]    B. Quantizing Power Allocation Vectors 
         [0060]    Having optimized[ 50 ] power-independent entries in the codebook of channel eigenmode matrices {circumflex over (V)}, the next step is to create a codebook for power allocation Ŝ[ 118 ]. We use a distortion metric defined as 
         [0000]    
       
         
           
             
               
                 
                   
                     γ 
                      
                     
                         
                     
                      
                     
                       s 
                        
                       
                         ( 
                         
                           k 
                           ; 
                           H 
                           ; 
                           P 
                         
                         ) 
                       
                     
                   
                   = 
                   
                     
                       det 
                        
                       
                         [ 
                         
                           I 
                           + 
                           
                             HQH 
                             H 
                           
                         
                         ] 
                       
                     
                     
                       det 
                        
                       
                         [ 
                         
                           I 
                           + 
                           
                             H 
                              
                             
                               
                                 V 
                                 ^ 
                               
                                
                               
                                 ( 
                                 
                                   n 
                                   opt 
                                 
                                 ) 
                               
                             
                              
                             
                               
                                 S 
                                 ^ 
                               
                                
                               
                                 ( 
                                 k 
                                 ) 
                               
                             
                              
                             
                               
                                 
                                   V 
                                   ^ 
                                 
                                 H 
                               
                                
                               
                                 ( 
                                 
                                   n 
                                   opt 
                                 
                                 ) 
                               
                             
                              
                             
                               H 
                               H 
                             
                           
                         
                         ] 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where Ŝ(k) is the kth entry in the predefined set of channel water-filling matrices and {circumflex over (V)}(n opt ) is the entry in the {circumflex over (V)} codebook that minimizes metric (4) for the given H. We use k=0,1, . . . 2 N     s   −1 where N S  is the number of bits per channel realization in the feedback link needed to represent the vectors Ŝ(k). Minimizing the metric in (8) is equivalent to minimizing the capacity loss between the optimum water-filling using Q and the quantized water-filling using {circumflex over (V)} and Ŝ. 
         [0061]    Similarly to the previous problem, we divide the whole space of channel realizations H into 2 N     s    regions S i (P) where 
         [0000]        S   i ( P )={ H:γs ( i;H;P )&lt;γ s ( j;H;P )for all  j≠i}.   (9)
 
         [0000]    and to create the codebook Ŝ, we use the following method:
       1. Create a large training set of L random matrices H(l).   2. For each random matrix H(l), perform water-filling operation to obtain optimum covariance matrices Q(l) and S(l).   3. Set iteration counter i=0. Create[ 100 ],[ 104 ] a set of 2 N     s    random diagonal matrices Ŝ (i) (k) with Tr(Ŝ (i) (k))=P.   4. For every codebook entry Ŝ (i) (k) and matrix Q(l) calculate[ 112 ] the metric as in (8). Choose[ 106 ] indexes k opt (l) corresponding to the lowest values of γ S (k;H(l);P).   5. If γ S (k opt (l);H(l);P)&gt;γ eq (H(l);P) where γ eq (H(l);P) is the metric corresponding to equal-power distribution defined as       
 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       γ 
                        
                       
                           
                       
                        
                       
                         eq 
                          
                         
                           ( 
                           
                             
                               H 
                                
                               
                                 ( 
                                 l 
                                 ) 
                               
                             
                             ; 
                             P 
                           
                           ) 
                         
                       
                     
                     = 
                     
                       
                         det 
                          
                         
                           [ 
                           
                             I 
                             + 
                             
                               
                                 H 
                                  
                                 
                                   ( 
                                   l 
                                   ) 
                                 
                               
                                
                               
                                 Q 
                                  
                                 
                                   ( 
                                   l 
                                   ) 
                                 
                               
                                
                               
                                 
                                   H 
                                   H 
                                 
                                  
                                 
                                   ( 
                                   l 
                                   ) 
                                 
                               
                             
                           
                           ] 
                         
                       
                       
                         det 
                          
                         
                           [ 
                           
                             I 
                             + 
                             
                               
                                 P 
                                 / 
                                 
                                   n 
                                   T 
                                 
                               
                                
                               
                                 H 
                                  
                                 
                                   ( 
                                   l 
                                   ) 
                                 
                               
                                
                               
                                 
                                   H 
                                   H 
                                 
                                  
                                 
                                   ( 
                                   l 
                                   ) 
                                 
                               
                             
                           
                           ] 
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 set the corresponding entry k opt (l)=2 N     s   . For all k calculate the subsets[ 108 ] L(k)={l:k opt (l)=k}. 
               
             
             6. For all k=0,1, . . . 2 N     s   −1[ 114 ] for which |L(k)|≠0, calculate[ 116 ] a new Ŝ (i+1) (k) as the arithmetic average 
           
         
       
     
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         S 
                         ^ 
                       
                       
                         ( 
                         
                           i 
                           + 
                           1 
                         
                         ) 
                       
                     
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   = 
                   
                     
                       1 
                       
                          
                         
                           L 
                            
                           
                             ( 
                             k 
                             ) 
                           
                         
                          
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           ∈ 
                           
                             L 
                              
                             
                               ( 
                               k 
                               ) 
                             
                           
                         
                       
                        
                       
                         S 
                          
                         
                           ( 
                           l 
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
       
         
           
             7. Calculate the average distortion metric 
           
         
       
     
         [0000]    
       
         
           
             
               
                 
                   
                     
                       γ 
                       _ 
                     
                     s 
                     
                       ( 
                       
                         i 
                         + 
                         1 
                       
                       ) 
                     
                   
                   = 
                   
                     
                       1 
                       L 
                     
                      
                     
                       
                         ∑ 
                         l 
                       
                        
                       
                         min 
                          
                         
                           { 
                           
                             
                               γ 
                                
                               
                                   
                               
                                
                               
                                 s 
                                  
                                 
                                   ( 
                                   
                                     
                                       
                                         k 
                                         opt 
                                       
                                        
                                       
                                         ( 
                                         l 
                                         ) 
                                       
                                     
                                     ; 
                                     
                                       
                                         H 
                                          
                                         
                                           ( 
                                           l 
                                           ) 
                                         
                                       
                                        
                                       P 
                                     
                                   
                                   ) 
                                 
                               
                             
                             , 
                             
                               
                                 γ 
                                 eq 
                               
                                
                               
                                 ( 
                                 
                                   
                                     H 
                                      
                                     
                                       ( 
                                       l 
                                       ) 
                                     
                                   
                                    
                                   P 
                                 
                                 ) 
                               
                             
                           
                           } 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
       
         
           
             8. If distortion metric fulfills |  γ   s   (i+1) −  γ   s   (i) |/  γ   s   (i) &lt;Θ, stop. Otherwise increase i with 1 and go to 4). 
           
         
       
     
         [0071]    The set of vectors Ŝ is then used to calculate the regions in (9). Since water-filling strongly depends on the power level P and {circumflex over (V)}, optimally the Ŝ should be created for every power level and number of bits N V  in eigenvector matrix codebook. As an example, the results of the above optimization are presented in  FIG. 11   b ) for a case of n T =n R =2, N V =2 and N S =1. The optimization was performed using L=1,000·2 N     s    and Θ=10 −7 . The curves show the entries on the diagonals of the two matrices Ŝ(k) normalized with P. As one can see, one of the matrices tends to assign all the power to one of the eigenmodes, while the other balances the assignment between them. As expected, the balancing becomes more even with increasing P where the capacity of the equal-power open-loop systems approaches the capacity of the water-filling closed-loop systems. Since the differences between the entries of Ŝ(k) are not that large for varying powers, it is possible to create an average codebook Ŝwhich could be used for all values of P but we do not treat this problem in here. 
         [0072]    An interesting property of the above algorithm is that it automatically adjusts the number of entries in Ŝ according to the number of entries in {circumflex over (V)}. For low values of N V , even if the algorithm for selection of Ŝ is started with high N S , the optimization process will reduce the search space by reducing cardinality |L(k)| of certain entries to 0. As a result, for N V =2,3, N S =1 will suffice, while for N V =4, the algorithm will usually converge to N S =2. This behavior can be easily explained since for low resolution of the channel eigenvector matrices {circumflex over (V)} only low precision is necessary for describing Ŝ. Only with increasing N V , the precision N S  becomes useful. 
       III. VQ Algorithm for Flat-Fading MIMO Channels 
       [0073]    The vector quantizers from the previous sections are first applied to a flat-fading channel case. In such a case, the elements of each matrix H in (1) are independent circular complex Gaussian elements, normalized to unit variance. 
         [0074]    The system operation can now be described as follows:
       1. The receiver[ 24 ] estimates the channel matrix H.   2. The receiver[ 24 ] localizes the region V i  according to (5) and stores its index as n opt .[ 32 ]   3. Using n opt , the receiver[ 24 ] places H in a region S i  according to (9) and stores its index as k opt .   4. If the resulting system capacity using the predefined codebook entries is higher than the capacity of equal power distribution as in       
 
         [0000]        C ( n   opt   ,k   opt )&gt;log 2   det[I+P/n   T   HH   H ](13)           indexes n opt  and k opt  are fed back to the transmitter.[ 34 ],[ 36 ]       5. The transmitter uses[ 40 ],[ 38 A] the received indices of a codebook entries to process its signal. If there is no feedback, power is distributed equally between the antennas [ 22 ].         
         [0081]    Using the above algorithm, the system&#39;s performance is lower-bounded by the performance of the corresponding open-loop system and improves if the receiver [ 24 ] finds a good match between the channel realization and the existing codebook entries. The salient advantage of such an approach is its flexibility and robustness to the changes of channel model. If there are no good matches in the codebook, the feedback link is not wasted and the transmitter uses the equal power distribution. The disadvantage of the system is that the feedback link is characterized by a variable bit rate. 
       IV. VQ Algorithm for Frequency-Selective MIMO-OFDM Channels 
       [0082]    In case of the frequency-selective channel, flat fading algorithm is applied to the separate OFDM sub-carriers. Although this approach is clearly sub-optimal, it allows us to use a generic vector quantizer trained to the typical flat-fading channel in a variety of other channels. 
         [0083]    In general case, the feedback rate for such an approach would be upperbounded by N OFDM (N V +N D ). However, as pointed out by Kim et al., the correlation between the adjacent sub-carriers in OFDM systems can be exploited to reduce the required feedback bit rate by proper interpolating between the corresponding optimum signalling vectors. In this work, we use a simpler method which allows the receiver[ 24 ] to simply group adjacent M sub-carriers and perform joint optimization using the same codebook entry for all of them (such methods are sometimes called clustering). 
       V. Simulation Results 
       [0084]    A. Flat-Fading Channel 
         [0085]    We tested the system on 2×2 MIMO and 4×4 MIMO channels with varying SNR and feedback rates. We tested 2×2 MIMO channel with N V =2,3,4 and N D =1, corresponding to total feedback rate of between 3 and 5 bits. Correspondingly, in case of 4×4 MIMO, we used N V =10,12,14 and N D =2, corresponding to total feedback rate between 12 and 16 bits. We define an additional parameter called feedback frequency, v which defines how often the receiver[ 24 ] requests a specific codebook entry instead of equal power distribution and an average feedback bit rate as R b =v(N V =N S ). 
         [0086]      FIG. 12(   a ) presents the results of simulations of ergodic capacity of the system (based on 100,000 independent channel matrices H) in case of perfect CSIT, vector quantized feedback (partial CSIT) and no CSIT. It is clearly seen that, even for very low bit rates on a feedback channel, the proposed scheme performs closely to the optimum. A rule of thumb seems to be that the number of bits needed to encode the codebook is approximately equal to n T ×n R . Moreover,  FIG. 12(   b ) shows that as the SNR grows, less feedback is required to provide good system performance and the proposed algorithm automatically reduces the reverse link usage. 
         [0087]    It is also interesting to note that increasing the quality of quantization increases the feedback frequency v. This is a consequence of the fact that there is a higher probability of finding a good transmit signal covariance matrix when there are a lot of entries in the codebook. 
         [0088]    B. Frequency-Selective Channel 
         [0089]    We have simulated the 2×2 MIMO system using the OFDM modulation with carrier frequency: f c =2 GHz; signal bandwidth; B=5 MHz, number of sub-carriers: N OFDM =256; ITU-R M.1225 vehicular A channel model with independent channels for all pairs of transmit and receive antennas[ 22 ][ 26 ]; the guard interval equal to the maximum channel delay. 
         [0090]    The results of simulations are presented in  FIG. 13 . Since the capacity curves of this system are very similar to capacity of the flat-fading 2×2 system in  FIG. 12  we decided to show the losses of performance as compared to the perfect water-filling case instead.  FIG. 13   a ) shows the loss of performance defined as C-C(M) where C is defined in (2) and C(N V , N S , M) is the capacity of the system with different feedback rates and clustering of M sub-carriers. As expected, increasing the clustering, decreases the throughput since the same covariance matrix is used for too many adjacent sub-carriers. At the same time, in  FIG. 13   b ) shows that the required average feedback rate decreases significantly with increasing M. For the simulated channel, the best results are provided by M=8, which is approximately equal to the coherence bandwidth of the channel. An interesting feature of the OFDM-MIMO is that, unlike in the flat-fading case, the feedback rate remains almost constant throughput the P range. In any case, however, around two orders of magnitude more feedback bit rate is required on frequency selective channel. 
       VI. System Model for Multi User Communication 
       [0091]    We assume that the communication system consists of a transmitter equipped with n T  antennas[ 22 ] and n T  mobile receivers[ 24 ] with identical statistical properties and n R (k) antennas[ 26 ], where k=1,2, . . . K. The mobile user channels are modeled by a set of i.i.d. complex Gaussian channel matrices H k  of dimension n R (k)×n T . (Throughout the document we use the upper-case bold letters to denote matrices and lower-case bold letters to denote vectors.) The received signal of the kth user is then given by the n R (k)-dimensional vector y k  defined as 
         [0000]        y   k   =H   k   x+n   k   (14)
 
         [0000]    where x is the n T -dimensional vector of the transmitted signal and n k  is the n R (k)-dimensional vector consisting of independent circular complex Gaussian entries with zero means and unit variances. Finally, we assume that the total transmit power at each transmission instant is equal to P. The above assumptions cover a wide class of wireless systems and can easily be further expanded to include orthogonal frequency division multiplexing (OFDM) on frequency-selective channels or users with different received powers (due to varying path loss and shadowing). 
         [0092]    Although theoretically it is possible to design the optimum CSI quantizer for the above canonical version of the system, such an approach may be impractical. For example, subsets of receivers [ 24 ] with different numbers of receive antennas [ 26 ] would require different CSI codebooks and quantizer design for such a system would be very complex. To alleviate this problem, we assume that the base station treats each user as if it was equipped with only one antenna[ 26 ], regardless of the actual number of antennas [ 26 ] it may have. While suboptimal, such an approach allows any type of a receiver[ 24 ] to work with any base station and may be even used to reduce the quantization noise as shown by Jindal. We call such system setup virtual multiple-input single-output (MISO) since, even though physically each transmitter-receiver link may be a MIMO link, from the base station&#39;s perspective it behaves like MISO. 
         [0093]    We follow the approach of Spencer et al., where each user performs singular value decomposition of H k =U k S k V k   H  [ 30 ] and converts its respective H k  to a n T -dimensional vector h k  as 
         [0000]        h   k   =u   k   H H k   =s   k   max   v   k   h   (15)
 
         [0000]    [ 42 ] where s k   max  is the largest singular value[ 30 A] of S k  and u k  and v k  are its corresponding vectors[ 30 ] from the unitary matrices U k  and V k , respectively. 
         [0094]    Based on (15), the only information that is fed[ 36 ], [ 36 A] back from[ 34 ],[ 34 A] the receivers [ 24 ] to the transmitter is the information about the vectors h k , which vastly simplifies the system design and allows for easy extensions. For example, if multiple streams per receiver are allowed, the channel information for each stream can be quantized using exactly the same algorithm. 
         [0000]    VII. System Design with Full CSIT 
         [0095]    In this section, we present typical approaches for the system design when full CSIT is available. As a simple form of multi-user selection diversity, we define a subset of active users with cardinality n T  as S. Furthermore, for each subset S, we define a matrix H[S]=[h 1   T , h 2   T , . . . ,h n     T     T ] T , whose rows are equal to the channel vectors h k  of the active users. 
         [0096]    A. Cooperative Receivers 
         [0097]    The upper-bound for system sum-rate is obtained when the users are assumed to be able to cooperate. With such an assumption, it is possible to perform singular value decomposition of the joint channel as H[S]=U[S] S [S] V H [S]. Defining s i  as the entries on the diagonal of S[S] allows to calculate the maximum sum-rate of a cooperative system as 
         [0000]    
       
         
           
             
               
                 
                   
                     R 
                     coop 
                   
                   = 
                   
                     
                       max 
                       S 
                     
                      
                     
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                         
                         
                           n 
                           T 
                         
                       
                        
                       
                         
                           [ 
                           
                             
                               log 
                               2 
                             
                              
                             
                               ( 
                               
                                 
                                   ξ 
                                    
                                   
                                     [ 
                                     S 
                                     ] 
                                   
                                 
                                  
                                 
                                   s 
                                   i 
                                   2 
                                 
                               
                               ) 
                             
                           
                           ] 
                         
                         + 
                       
                     
                   
                 
               
               
                 
                   ( 
                   16 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where ξ[S] is the solution of the water-filling equation Σ i=1   n     T   [ξ[S]−1/s i   2 ] + =P. 
         [0098]    B. Zero-Forcing Dirty-Paper Coding 
         [0099]    In practice, the receivers[ 24 ] cannot cooperate and the full diagonalization of the matrix H[S] is impossible. The problem can still be solved by using linear zero-forcing (ZF) followed by non-linear dirty paper precoding, which effectively diagonalizes the channels to the active users. The matrix H[S] is first QR-decomposed as H[S]=L[S]Q[S], where L[S] is lower triangular matrix and Q[S] is a unitary matrix. After multiplying the input vector x by Q[S]H, the resulting channel is equal to L[S], i.e., the first user does not suffer from any multi-user interference (MUI), the second user receives interference only from the first user, etc. 
         [0100]    In this case, non-causal knowledge of the previously encoded signals can be used in DPC encoder allowing the signal for each receiver[ 24 ]i&gt;1 to be constructed in such a way that the previously encoded signals for users k&lt;i, are effectively canceled at the ith receiver[ 24 ]. Since the effective channel matrix is lower triangular, the channel will be diagonalized after the DPC, with l i  being the entries on the diagonal of L[S]. This leads to maximum sum-rate calculation as 
         [0000]    
       
         
           
             
               
                 
                   
                     R 
                     
                       zf 
                       - 
                       dpc 
                     
                   
                   = 
                   
                     
                       max 
                       
                         S 
                         ord 
                       
                     
                      
                     
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                         
                         
                           n 
                           T 
                         
                       
                        
                       
                         
                           [ 
                           
                             
                               log 
                               2 
                             
                              
                             
                               ( 
                               
                                 
                                   ξ 
                                    
                                   
                                     [ 
                                     
                                       S 
                                       ord 
                                     
                                     ] 
                                   
                                 
                                  
                                 
                                   l 
                                   i 
                                   2 
                                 
                               
                               ) 
                             
                           
                           ] 
                         
                         + 
                       
                     
                   
                 
               
               
                 
                   ( 
                   17 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where ξ[S ord ] is the solution of the water-filling equation. Note that, as opposed to (16), the maximization is performed over ordered versions of the active sets S. 
         [0101]    C. Linear Modulation 
         [0102]    Even though, theoretically, the above approach solves the problem of the receiver[ 24 ] non-cooperation, its inherent problem is the absence of effective, low complexity DPC algorithms. Moreover, since dirty-paper coding requires full CSIT it is likely that systems employing DPC would require significantly higher quality of channel feedback than simpler, linear precoding systems. 
         [0103]    We use the linear block diagonalization approach, which eliminates MUI by composing the modulation matrix B[S] of properly chosen null-space eigenmodes for each set S. For each receiver[ 24 ]i∈S, the ith row of the matrix H[S] is first deleted to form H[S i ]. In the next step, the singular value decomposition is performed[ 30 ],[ 30 A] to yield H[S i ]=U[S i ]S[S i ]V H [S i ]. By setting the ith column of B[S] to be equal to the rightmost vector of V[S i ], we force the signal to the ith receiver[ 24 ] to be transmitted in the null-space of the other users and no MUI will appear. In other words, the channel will be diagonalized with d i  being the entries on the diagonal of H[S]B[S]. This leads to formula 
         [0000]    
       
         
           
             
               
                 
                   
                     R 
                     linear 
                   
                   = 
                   
                     
                       max 
                       S 
                     
                      
                     
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                         
                         
                           n 
                           T 
                         
                       
                        
                       
                         
                           [ 
                           
                             
                               log 
                               2 
                             
                              
                             
                               ( 
                               
                                 
                                   ξ 
                                    
                                   
                                     [ 
                                     S 
                                     ] 
                                   
                                 
                                  
                                 
                                   d 
                                   i 
                                   2 
                                 
                               
                               ) 
                             
                           
                           ] 
                         
                         + 
                       
                     
                   
                 
               
               
                 
                   ( 
                   18 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where ξ[S] is the solution of the water-filling equation. 
         [0104]    As an example,  FIG. 14  shows the sum-rates of the discussed systems for K=10 users and different antenna configurations. The zero-forcing DPC system approaches the cooperative system&#39;s sum-rate as the transmitted power increases. The sub-optimal linear modulation provides lower sum-rate but losses at P&gt;0 dB, as compared to the ZF-DPC system, are in the range of only 1-2 dB for the 4×4 configuration and fractions of dB for the 2×2 system. Since the linear system is much easier to implement than ZF-DPC, we will use it to test our CSI encoding algorithms. 
         [0000]    VIII. System Design with Partial CSIT 
         [0105]    The systems discussed so far are usually analyzed with assumption that, at any given time, the transmitter will have full information about the matrices H[S]. Unfortunately, such an assumption is rather unrealistic and imperfect CSIT may render solutions relying on full CSIT useless. 
         [0106]    In practice, the receivers[ 24 ] will quantize the information about their effective channel vectors h k [ 30 ] as ĥ k  [ 32 ], according to some optimization criterion. Based on this information, the transmitter will select[ 38 ],[ 52 ],[ 62 ] the best available modulation matrix {circumflex over (B)} from the predefined transmitter codebook and perform water-filling using the best predefined power division matrix {circumflex over (D)}. Regardless of the optimization criterion, the finite cardinality of the vector codebooks will increase MUI and lower system throughput.  FIG. 15  shows the mechanism leading to appearance of the MUI in a simple system with n T =2 and K=2 users with effective channel vectors h 1  and h 2 , encoded by the quantizer as ĥ 1  and ĥ 2 . If the full CSIT is available, the transmitter will choose[ 38 ] a modulation matrix based on eigenmodes v 1  and v 2 , which are perpendicular to vectors h 2  and h 1 , respectively. As a result, each user will be able to extract its desired signal without MUI. With partial CSIT, however, the transmitter will obtain only approximate versions of the effective channel vectors, and the resulting modulation matrix will be based on eigenmodes {circumflex over (V)} 1  and {circumflex over (V)} 2 , whose dot products with h 2  and h 1  will not be zero, causing the MUI. 
       IX. CSI Quantization Algorithms 
       [0107]    The fundamental difference between CSI encoding in single-user and multiple-user systems is that during normal system operation, each receiver[ 24 ] chooses its vector ĥ k  without any cooperation with other receivers[ 24 ]. This means that the design of optimum codebook for h k  must precede the design of codebooks {circumflex over (B)} and {circumflex over (D)}. Based on (15), one can see that channel state information in form of the vector h k  consists of the scalar value of channel gain[ 30 A] s k   max  and the eigenmode[ 30 ] v k   H . Since these values are independent, we propose an algorithm which separately quantizes the information about eigenmodes[ 32 ] in codebook {circumflex over (v)} and amplitude gains[ 32 A] in codebook ŝ. 
         [0108]    A. Quantization[ 32 ],[ 51 ] of Receiver Channel Eigenmodes 
         [0109]    We assume that N v  is the number of bits per channel realization in the feedback link needed to represent the vectors v k  in (15). We divide the space of all possible v&#39;s into 2 N     v    regions v i    
         [0000]        v   i   ={v:γ   v ( i;v )&lt;γ v ( j;v )for all  j≠i}   (19)
 
         [0000]    where γ v (n; v) is a distortion function. Within each region v i , we define a centroid vector {circumflex over (v)}(i)[ 49 ], which will be used as a representation of the region. The design of the codebook is {circumflex over (v)} can be done analytically and/or heuristically using for example the Lloyd algorithm. In this work, we define the distortion function as the angle between the actual vector v and is {circumflex over (v)}(i): γ v (i;v)=cos −1 ({circumflex over (V)}(i)·v), which has been shown by Roh and Rhao to maximize ergodic capacity, and use Lloyd algorithm to train[ 47 ] the vector quantizer. Note that the construction of is T is independent of the transmit power. 
         [0110]    B. Quantization[ 32 A] of Receiver Amplitude Gains 
         [0111]    We assume that N S  is the number of bits per channel realization in the feedback link needed to represent the scalar s k   max  in (15). We divide the space of all possible channel realizations s=s k   max  into 2 N     s    regions s i    
         [0000]        s   i   ={s :|ŝ( i )− s|&lt;ŝ|&lt;|ŝ ( j )− s |for all  j≠i}   (20)
 
         [0000]    where ŝ(i) [ 100 ] are scalar centroids representing regions s i . In this work, we perform the design[ 102 ] of the codebook ŝ using the classical non-uniform quantizer design algorithm with distortion function given by quadratic function of the quantization error as ∈(i,s)=(s−ŝ(i)) 2 . 
         [0112]    The construction of the codebook ŝ is generally dependent on the transmit power level. However, as pointed out above the differences between the codebooks ŝ for different power regions are quite small. This allows us to create only one codebook ŝ and use it for all transmit powers. 
         [0113]    C. Quantization of the Transmitter Modulation Matrices 
         [0114]    The calculation of the modulation matrix {circumflex over (B)} is based on the given codebook {circumflex over (v)}. We assume that the quantization[ 32 ] of the channel eigenmodes is performed at the receiver[ 24 ] side and each user transmits[ 34 ] back its codebook index i k . The indices are then used at the transmitter side to select[ 38 ][ 52 ][ 62 ] the modulation matrix {circumflex over (B)}(i 1 , i 2 , . . . i K ). Since, from the linear transmitter point of view, ordering of the users is not important, we will use the convention that the indices (i 1 , i 2 , . . . i K ) are always presented in the ascending order. For example, in a system with K=2, n T =2 and 1-bit vector quantizers {circumflex over (v)}, there will exist only three possible modulation matrices corresponding to sets of {circumflex over (v)} indices (1,1), (1,2) and (2,2). 
         [0115]    In the context of vector quantizing, the design of the modulation matrices can no longer be based on the algorithm presented in Section VII.C. Using this method with quantized versions of h k  produces wrong result when identical indices i k , are returned and the receiver[ 24 ] attempts to jointly optimize transmission to the users with seemingly identical channel vectors ĥ k . Instead, we propose the following algorithm to optimize the set of matrices {circumflex over (B)}(i 1 , i 2 , . . . i K ):
       1. Create a large set of Nn T  random matrices[ 46 ] H k , where N is the number of training sets with n T  users each.   2. For each random matrix H k , perform singular value decomposition[ 68 ] and obtain h k [ 70 ] as in (15).   3. For each vector h k  store[ 74 ] the index i k  of the corresponding entry {circumflex over (v)}(i k ).   4. Divide[ 76 ] the entire set of matrices H k  into N sets with n T  elements each.   5. Sort[ 78 ] the indices i k  within each set l in the ascending order. Map[ 78 ] all unique sets of sorted indices to a set of unique indices I B  (for example (1,1) I B =1; (1,2) I B =2; (2,2) I B =3 . . . ).   6. In each set l, reorder the corresponding channel vectors h k  according to their indices i k  and calculate[ 80 ] the optimum B l  using the method from Section VII.C.   7. Calculate[ 84 ] a set {circumflex over (B)}(I B ) as a column-wise spherical average of all entries B 1  corresponding to the same[ 82 ] index I B .       
 
         [0123]    After calculation of |I B | modulation matrices {circumflex over (B)}, the remaining part of system design is the calculation of the water-filling matrices {circumflex over (D)}, which divide the powers between the eigenmodes at the transmitter. The procedure for creation of codebook {circumflex over (D)}[ 118 ] is similar to the above algorithm, with the difference that the entries ŝ(n k ) are used instead of {circumflex over (v)}(i k ), and the spherical averaging of the water-filling matrices is performed diagonally, not column-wise. Explicitly:
       1. Create a large set of Nn T  random matrices [ 46 ] H k , where N is the number of training sets with n T  users each.   2. For each random matrix H k , perform singular value decomposition[ 104 ] and obtain h k  as in (15).   3. For each vector h k  store the index n k  of the corresponding entry ŝ(n k ).[ 106 ]   4. Divide the entire set of matrices H k  into N sets with n T  elements each. [ 108 ]   5. Sort the indices n k  within each set l in the ascending order. Map all unique sets of sorted indices to a set of unique indices I D  (for example (1, 1)→I D =1; (1, 2)→I D =2; (2,2)→I D =3 . . . ).[ 110 ]   6. In each set l, reorder the corresponding channel vectors h k  according to their indices n k  and calculate the optimum D 1  using the method of water-filling from Section VII.C.[ 112 ]   7. Calculate[ 116 ] a set D (I D ) as a diagonal spherical average of all entries D l  corresponding to the same[ 114 ] index I D .       
 
         [0131]    D. System Operation 
         [0132]    The matrices B and D are used in the actual system in the following way:
       1. The K mobile receivers [ 24 ] estimate[ 30 ],[ 30 A] their channels and send the indices i k [ 34 ] and n k [ 34 A] of the corresponding receiver quantizer entries {circumflex over (v)}(i k )[ 32 ] and ŝ(n k )[ 32 A] to the base station.   2. The transmitter forms l sets of users corresponding to all combinations of n T  users out of K. Within each set l, the indices i k [ 58 ] and n k [ 63 ] are sorted in the ascending order and mapped to their respective indices I B (l)[ 60 ] and I D (l)[ 64 ];   3. Within each set l, the matrices {circumflex over (B)}[I B (l)][ 52 ],[ 62 ] and {circumflex over (D)}[I D (l)] [ 54 ],[ 38 A] are used to estimate[ 56 ],[ 66 ] instantaneous sum-rate R(l).   4. The base station flags the set of users providing highest R(l) as active for the next transmission epoch.   5. The transmitter uses the selected matrices to transmit information.       
 
         [0138]    E. Nested Quantization of Channel Eigenmodes 
         [0139]    The above algorithm does not assume any previous knowledge of the channel and the feedback rate required to initially acquire the channel may be high. In order to reduce it on slowly varying channels, we propose a nested quantization method shown in  FIG. 16 . In this example, an initial coarse quantization of the CSI is performed[ 88 ] using only 2 bits. Assuming[ 98 ] that the actual channel vector lies in region v 3  and that it stays within this region during the transmission of subsequent frames [ 90 ],[ 92 ],[ 94 ], it is possible to further quantize v 3  using nested, precise quantization[ 96 ]. In this way, the effective feedback rate is still 2 bits, but the resolution corresponds to a 4-bit quantizer. In order to quantify the possibility of such a solution, we introduce eigenmode coherence time τ eig (N v ), which, related to the frame duration T frame , shows for how long the channel realization stays within the same region v i  of the N v -bit quantizer. Notice that eigenmode coherence time depends on the number of bits N v : the higher the initial VQ resolution, the faster the channel vector will move to another region and the benefits of nested quantization will vanish. 
       X. Simulation Results 
       [0140]    We have implemented our system using a base station with n T =2 and a set of K mobile receivers[ 24 ] with identical statistical properties and n R (k)=n T =2. We have varied the number of users from 2 to 10 and optimized vector quantizers using methods presented above. Each system setup has been simulated using 10,000 independent channel realizations. 
         [0141]      FIGS. 17 and 18  show the results of the simulations for varying feedback rates. Except for very high transmit power values P&gt;15 dB, it is possible to closely approach the sum-rate of the full CSI system with 8 bits (N v =7, N s =1) in the feedback link. The required feedback rate N v  is much higher than N s , which shows the importance of high quality eigenmode representation in multiuser systems. In high power region, increasing N v  by 1 bit increases the spectral efficiency by approximately 1 bit/channel use. 
         [0142]      FIG. 19  shows the results of nested quantization with low feedback rates when the channel&#39;s eigenmode coherence time is longer than frame duration. If such a situation occurs, the considered system may approach the theoretical full CSIT sum-rate using only 5 bits per channel use in the feedback link. 
         [0143]    Note that further feedback rate reduction can be achieved with the algorithm presented by Jindal. However, we will not present these results here. 
       XI. Additional Matter 
       [0144]    In case of multiple user systems, multi-user diversity may be achieved by a simple time-division multiplexing mode (when only one user at a time is given the full bandwidth of the channel) or scheduling the transmission to multiple users[ 24 ] at a time. Here we analyze the former approach and assume that the base station will schedule only one user[ 24 ] for transmission. 
         [0145]    If the system throughput maximization is the main objective of the system design, the transmitter must be able to estimate[ 56 ] the throughput of each of the users, given the codebook indices it received from each of them. Assuming that the kth user returned indices requesting the eigenmode codeword {circumflex over (V)} k  and power allocation codeword Ŝ k , the user&#39;s actual throughput is given as 
         [0000]        R   k   single =log 2   det[I   n     R     (k)   +H   k   {circumflex over (V)}   k   Ŝ   k   {circumflex over (V)}   k   H   H   k   H ]  (21)
 
         [0146]    Using singular value decomposition of channel matrix H k  and equality det[I n     R     (k) +H k {circumflex over (Q)} k H k   H ]=det[I n     T   +{circumflex over (Q)} k H k   H H k ], it can be shown that 
         [0000]        R   k   single =log 2   det[I   n     T     +H   k   {circumflex over (V)}   k   Ŝ   k   {circumflex over (V)}   k   H   H   k   H   H   k ]=log 2   det[I   n     R     (k)   +Ŝ   k   E   k   H   D   k   2   E   k ]  (22)
 
         [0000]    where E k =V k   H {circumflex over (V)} k  is a matrix representing the match between the actual eigenmode matrix of the channel and its quantized representation (with perfect match E k =I n     T   ). 
         [0147]    In practice, the actual realization of E k  will not be known at the transmitter, and its mean quantized value Ê k , matched to {circumflex over (V)} k  must be used instead. Similarly, the transmitter must use a quantized mean value {circumflex over (D)} k , which is matched to the reported water-filling matrix Ŝ k . This leads to the selection criterion for the optimum user[ 24 ] k opt   
         [0000]    
       
         
           
             
               
                 
                   
                     k 
                     opt 
                   
                   = 
                   
                     arg 
                      
                     
                         
                     
                      
                     
                       
                         max 
                         
                           
                             k 
                             = 
                             1 
                           
                           , 
                           2 
                           , 
                           
                               
                           
                            
                           
                             … 
                              
                             
                                 
                             
                              
                             K 
                           
                         
                       
                        
                       
                         
                           log 
                           2 
                         
                          
                         
                           
                             det 
                              
                             
                               [ 
                               
                                 
                                   I 
                                   
                                     
                                       n 
                                       R 
                                     
                                      
                                     
                                       ( 
                                       k 
                                       ) 
                                     
                                   
                                 
                                 + 
                                 
                                   
                                     
                                       S 
                                       ^ 
                                     
                                     k 
                                   
                                    
                                   
                                     
                                       E 
                                       ^ 
                                     
                                     k 
                                     H 
                                   
                                    
                                   
                                     
                                       D 
                                       ^ 
                                     
                                     k 
                                     2 
                                   
                                    
                                   
                                     
                                       E 
                                       ^ 
                                     
                                     k 
                                   
                                 
                               
                               ] 
                             
                           
                           . 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   23 
                   ) 
                 
               
             
           
         
       
     
         [0148]    Similarly to single-user selection, also in the case of multi-user selection the choice of active users must be made based on incomplete CSIT. The quantized CSI will result in appearance of multi-user interference. We represent this situation using variable Ê k,l ={circumflex over (v)} k   H [{circumflex over (B)} S ] ·,l , which models the dot product of the quantized eigenmode  v   k   H  reported by the kth user in the set S, and the lth vector in the selected modulation matrix[ 52 ] {circumflex over (B)} S . 
         [0149]    Moreover, assuming that the quantized singular value of the kth user in the set S is given by {circumflex over (d)} k  and the transmitter uses power allocation matrix[ 54 ] Ŝ S , the estimated sum-rate of the subset S is given as[ 56 ] 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       R 
                       multi 
                     
                      
                     
                       ( 
                       S 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         k 
                         ∈ 
                         S 
                       
                     
                      
                     
                       
                         
                           log 
                           2 
                         
                         ( 
                         
                           1 
                           + 
                           
                             
                               P 
                                
                               
                                 
                                   
                                     
                                       d 
                                       ^ 
                                     
                                     k 
                                     2 
                                   
                                    
                                   
                                     [ 
                                     
                                       
                                         S 
                                         ^ 
                                       
                                       S 
                                     
                                     ] 
                                   
                                 
                                 
                                   k 
                                   , 
                                   k 
                                 
                               
                                
                               
                                 
                                   E 
                                   ^ 
                                 
                                 
                                   k 
                                   , 
                                   k 
                                 
                                 2 
                               
                             
                             
                               1 
                               + 
                               
                                 P 
                                  
                                 
                                   
                                     d 
                                     ^ 
                                   
                                   k 
                                   2 
                                 
                                  
                                 
                                   
                                     ∑ 
                                     
                                       l 
                                       ≠ 
                                       k 
                                     
                                   
                                    
                                   
                                     
                                       
                                         [ 
                                         
                                           
                                             S 
                                             ^ 
                                           
                                           S 
                                         
                                         ] 
                                       
                                       
                                         l 
                                         , 
                                         l 
                                       
                                     
                                      
                                     
                                       
                                         E 
                                         ^ 
                                       
                                       
                                         k 
                                         , 
                                         l 
                                       
                                       2 
                                     
                                   
                                 
                               
                             
                           
                         
                         ) 
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   24 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Note that, due to the finite resolution of the vector quantizer, the multi-user interference will lower the max sum-rate R multi (S)&lt;R max  for all S. 
         [0150]    Based on (24) the choice of the active set of users is then performed as 
         [0000]    
       
         
           
             
               
                 
                   { 
                   
                     
                       
                         
                           
                             
                               x 
                               k 
                             
                             = 
                             
                               
                                 min 
                                 x 
                               
                                
                               
                                 
                                   ∑ 
                                   
                                     l 
                                     ∈ 
                                     L 
                                   
                                 
                                  
                                 
                                   
                                     cos 
                                     
                                       - 
                                       1 
                                     
                                   
                                    
                                   
                                     ( 
                                     
                                       
                                         
                                           [ 
                                           
                                             V 
                                             l 
                                           
                                           ] 
                                         
                                         
                                           · 
                                           
                                             , 
                                             k 
                                           
                                         
                                       
                                       · 
                                       x 
                                     
                                     ) 
                                   
                                 
                               
                             
                           
                           , 
                         
                       
                       
                         
                           
                             k 
                             = 
                             1 
                           
                           , 
                           2 
                           , 
                           
                             3 
                              
                             
                                 
                             
                              
                             … 
                           
                         
                       
                     
                     
                       
                         
                           
                             
                               
                                 x 
                                 k 
                               
                               · 
                               
                                 x 
                                 l 
                               
                             
                             = 
                             0 
                           
                           , 
                         
                       
                       
                         
                           k 
                           ≠ 
                           l 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   30 
                   ) 
                 
               
             
           
         
       
     
         [0151]    One can also modify the algorithm presented. in section II.A as follows: we use a simple iterative heuristic based on a modified form of the Lloyd algorithm, which has very good convergence properties. The algorithm starts by creating a random codebook of centroids {circumflex over (V)} and iteratively updates it until the mean distortion metric changes become smaller than a given threshold. 
         [0152]    The algorithm works as follows:
       1. Create a large training set of L random matrices H l .[ 46 ]   2′ For each random matrix H l , perform singular value decomposition to obtain V l  as in (3).   3′ Align orientation of each vector in V l  to lie within the same 2n T -dimensional hemisphere.   4. Set iteration counter i=0. Create a set of 2 N     v    random matrices Ĥ(n).   5. For each matrix Ĥ(n), calculate corresponding {circumflex over (V)} (i) (n) using singular value decomposition.   6. Align orientation of each vector in {circumflex over (V)} (i) (n) to lie within the same 2n T -dimensional hemisphere.   7. For each training element H l  and codebook entry {circumflex over (V)} (i) (n), calculate the metric in (4). For every l, choose the index n opt (l) corresponding to the lowest value of γv(n;H l ). Calculate the subsets L(n)={l:n opt (l)=n} for all n.   8. Calculate new matrix {circumflex over (V)} (i+1) (n) as a constrained spherical average  V   l   O  of all entries V L  corresponding to the same index n       
 
         [0000]        {circumflex over (V)}   (i+1) ( n )=   V     l   O | l∈L(n)   (26)
       9. For each region n, where cardinality |L(n)|≠0, calculate the mean eigenmode match matrix       
 
         [0000]    
       
         
           
             
               
                 
                   
                     S 
                     opt 
                   
                   = 
                   
                     
                       arg 
                       S 
                     
                      
                     
                         
                     
                      
                     max 
                      
                     
                         
                     
                      
                     
                       
                         
                           R 
                           vq 
                         
                          
                         
                           ( 
                           S 
                           ) 
                         
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   25 
                   ) 
                 
               
             
           
         
       
       
         
           
             10. Calculate the average distortion metric 
           
         
       
     
         [0000]        γ   V   (i+1) =1 /LΣ   l γ V ( n   opt ( l ); H   l )
       11. If the distortion metric fulfills |  γ   V   (i+1) −  γ   V   (i) |/  γ   V   (i) &lt;Θ, where Θ is a design parameter, stop. Otherwise increase i by 1, and go to 7).       
 
         [0164]    Upon completion of the above algorithm, the final set of vectors {circumflex over (V)} can be used to calculate the regions V i  in (5). 
         [0165]    The design of the transmitter modulation matrices presented in section IX.C can be modified as follows: we propose the following algorithm to optimize the set of matrices {circumflex over (B)}(i 1 ,i 2 , . . . i n     T   ):
       1. Create a large set of Ln T  random matrices H l , where L is the number of training sets with n T  users each.   2. For each random matrix H l , perform singular value decomposition[ 68 ] and obtain h l [ 70 ] as in (15).   3. Align orientation of each vector h l  to lie within the same 2n T -dimensional hemisphere.   4. For each vector h l , store[ 74 ] the index i l  of the corresponding entry {circumflex over (v)}(i l ).   5. Divide[ 76 ] the entire set of matrices H i  into L sets with n T  elements each.   6. Sort[ 78 ] the indices i l  within each set in the ascending order. Map[ 78 ] all unique sets of sorted eigenmode indices i l  to a set of unique modulation matrix indices I B  (for example, if n T =2: (1,1)→I B =1; (1,2)→I B =2; (2,2)→I B =3 . . . ).   7. In each set L(I B )={l:(i 1 ,i 2 , . . . i n     T   )→I B }, reorder the channel vectors h l  according to the indices i l  and calculate[ 80 ] the optimum B l  using the method from Section VII.C.   8. Calculate[ 84 ] the set {circumflex over (B)}(I B ) as a column-wise spherical average of all entries B i  corresponding to the same[ 82 ] index I B  as       
 
         [0000]      ∀ n=1,2, . . . n     T     [{circumflex over (B)} ( I   B )] ·,n =  [ B   l ] ·,n     O | L(I     B     ) )  (28)
 
         [0174]    After completion of the above algorithm, the transmitter will have the set of |I B | modulation matrices {circumflex over (B)}(I B ) corresponding to all sorted combinations of the channel eigenmode indices that can be reported by the receivers. 
         [0175]    To clarify our notation for spherical average used in (26) and (28), we outline a method to calculate a spherical average of a set of unit-length vectors, and a spherical average of a set of unitary matrices, preserving the mutual perpendicularity of the component vectors. We use the notation  v l     O | l∈L  to represent a spherical average of all unit-length vectors v l  contained in a set L. Based on  Statistical Analysis of Spherical Data  by Fisher et al., we define the spherical average as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         E 
                         ^ 
                       
                       
                         ( 
                         
                           i 
                           + 
                           1 
                         
                         ) 
                       
                     
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                   = 
                   
                     
                       1 
                       
                          
                         
                           L 
                            
                           
                             ( 
                             n 
                             ) 
                           
                         
                          
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           ∈ 
                           
                             L 
                              
                             
                               ( 
                               n 
                               ) 
                             
                           
                         
                       
                        
                       
                         
                           V 
                           l 
                           H 
                         
                          
                         
                           
                             
                               
                                 V 
                                 ^ 
                               
                               
                                 ( 
                                 
                                   i 
                                   + 
                                   1 
                                 
                                 ) 
                               
                             
                              
                             
                               ( 
                               n 
                               ) 
                             
                           
                           . 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   27 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where the unit-length vector x is found using one of the constrained non-linear optimization algorithms. 
         [0176]    In case of the spherical average of a set of unitary matrices, denoted as  v l     O | l∈L , the averaging of the unit-length column vectors must be performed in a way that the resulting matrix is also unitary. We represent the spherical matrix average as a collection of unit-length vectors x l  as  V   O =[x 1 , x 2 , x 3 , . . . ] and jointly optimize them as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           v 
                           l 
                         
                         _ 
                       
                       O 
                     
                      
                     
                       | 
                       
                         l 
                         ∈ 
                         L 
                       
                     
                   
                   = 
                   
                     
                       min 
                       x 
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           ∈ 
                           L 
                         
                       
                        
                       
                         
                           cos 
                           
                             - 
                             1 
                           
                         
                          
                         
                           ( 
                           
                             
                               v 
                               l 
                             
                             · 
                             x 
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   29 
                   ) 
                 
               
             
           
         
       
     
         [0177]    Immaterial modifications may be made to the embodiments described here without departing from what is covered by the claims. 
         [0178]    While illustrative embodiments have been illustrated and described, it will be appreciated that various changes can be made therein without departing from the spirit and scope of the invention.