# Patent

## Title
Data loading method, transmitter, and base station

## Abstract

The invention is related to a data loading method in a communication system where sub-carriers include eigenmodes, comprising, for instance: arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels; pre-allocating transmission power to the eigenmodes with the aid of the calculated required power for achieving the approximated signal-to-noise ratio; determining collective transmission power to be allocated to each cluster based on the pre-allocation; allocating collective transmission power to the eigenmodes.

## Background
FIELD
The invention relates to a data loading method in a communication system, a transmitter and a base station.
BACKGROUND
Systems based on using multiple antennas are one of the most promising techniques for achieving high data rates. By combining MIMO (multiple input multiple output) techniques with OFDM (orthogonal frequency division multiplexing) modulation, the frequency selective MIMO channel is turned into a set of frequency flat MIMO fading channels which can be individually processed.
If a channel is known at a transmitter side, the channel matrix can be decomposed for each sub-carrier using SVD (singular value decomposition). As a result a set of orthogonal sub-channels is obtained in the space domain. These elementary sub-channels are also called eigenmodes.
One prior art method to find the optimal bit and power allocation for a set of multiple parallel sub-channels (for example, for eigenmodes of a MIMO-OFDM system) is Hughes-Hartog (HH) algorithm. Hughes-Hartog algorithm is depicted in John A. C: Bingham: Multicarrier Modulation for Data Transmission: An Idea Whose Time Has Come, IEEE Communications Magazine, pp. 5-14, May 1990, which is taken herein as a reference. However, the required computational effort of Hughes-Hartog algorithm increases with the average bit rate and therefore it is not a practical solution for high bit rate systems
Some sub-optimal fast loading algorithms have been proposed in Peter S. Chow, John M. Cioffi and John A. C. Bingham: A Practical Discrete Multitone Transceiver Loading Algorithm over Spectral Shaped Channels, IEEE Trans. on Communications, vol. 43, no. 2/3/4, pp. 773-775, February/March/April 1995, Robert F. H. Fischer and Johannes B. Huber: A New Loading Algorithm for Discrete Multitone Transmission, IEEE Proceeding of Global Telecommunications Conferences, vol. 1, pp. 724-728, November 1996 and Yu Wei and John M. Cioffi: On Constant Power Water-Filling”, IEEE Proceeding of International Conference on Communications, vol. 6, pp. 1665-1669, June 2001 which are taken herein as a reference.
These prior art methods are developed for slow varying channels like asymmetric digital subscriber line. For such channels, the signalling overhead required, for instance, for informing a receiver about the modulation scheme of each eigenmode can be neglected due to possibility to update the transmission parameters at relatively long time intervals. However, when the channel is changing fast, as is the case in wireless systems, the transmission parameters can be kept constant only for a time period shorter than the channel coherence time and therefore the amount of signalling overhead is significant.
BRIEF DESCRIPTION OF THE INVENTION
According to an aspect of the invention, there is provided a data loading method in a communication system where sub-carriers include eigenmodes, comprising: estimating a channel matrix; calculating a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates; defining biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases; carrying out bias compensation for eigenvalue estimates based on the defined biases; calculating equivalent power gain; arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels; pre-allocating transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain; determining collective transmission power to be allocated to each cluster based on the pre-allocation, selecting the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.
According to another aspect of the invention, there is provided a transmitter of a communication system where sub-carriers are divided into eigenmodes, comprising: means for estimating a channel matrix; means for calculating a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates; means for defining biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases; means for carrying out bias compensation for eigenvalue estimates based on the defined biases; means for calculating equivalent power gain; means for arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels; means for pre-allocating transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain; means for determining collective transmission power to be allocated to each cluster based on the pre-allocation; means for selecting the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.
According to another aspect of the invention, there is provided a transmitter of a communication system where sub-carriers are divided into eigenmodes, configured to: estimate a channel matrix; calculate a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates; define biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases; carry out bias compensation for eigenvalue estimates based on the defined biases; calculate equivalent power gain; arrange eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels; pre-allocate transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain; determine collective transmission power to be allocated to each cluster based on the pre-allocation; select the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.
According to another aspect of the invention, there is provided a base station of a communication system where sub-carriers are divided into eigenmodes, comprising: means for estimating a channel matrix; means for calculating a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates; means for defining biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases; means for carrying out bias compensation for eigenvalue estimates based on the defined biases; means for calculating equivalent power gain; means for arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels; means for pre-allocating transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain; means for determining collective transmission power to be allocated to each cluster based on the pre-allocation; means for selecting the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.
According to another aspect of the invention, there is provided a base station of a communication system, where sub-carriers are divided into eigenmodes, configured to: estimate a channel matrix; calculate a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates; define biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases; carry out bias compensation for eigenvalue estimates based on the defined biases; calculate equivalent power gain; arrange eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels; pre-allocate transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain; determine collective transmission power to be allocated to each cluster based on the pre-allocation; select the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.
Embodiments of the invention are described in the dependent claims.
The method and system of the invention provide several advantages. In a preferred embodiment of the invention, a sub-optimal low-complexity bit and power loading method that requires low signalling overhead is provided. Therefore the algorithm is especially suitable for high bit rate systems. The algorithm is also robust against channel estimation errors at the transmitter side.



LIST OF DRAWINGS
In the following, the invention will be described in greater detail with reference to the preferred embodiments and the accompanying drawings, in which
FIG. 1 shows an example of a communication system,
FIG. 2 is a flow chart, and
FIG. 3 illustrates an example of a transmitter structure.



DESCRIPTION OF EMBODIMENTS
With reference to FIG. 1, we examine an example of a data transmission system in which the preferred embodiments of the invention can be applied. The present invention can be applied in various wireless communication systems based on MIMO-OFDM. One example of such a communication system is IEEE 802.11a wireless LAN communication system. The basic idea of OFDM is to split a high-rate data stream into parallel streams that are transmitted simultaneously over different orthogonal sub-carriers. An OFDM signal consists of a sum of sub-carriers that are modulated by using phase shift keying (PSK) or quadrature amplitude modulation (QAM). MIMO systems include multiple transmission and reception antennas. It is clear to a person skilled in the art that the method according to the invention can be applied to systems utilizing different modulation methods or air interface standards.
In MIMO-OFDM systems, the frequency selective MIMO channel is turned into a set of frequency flat MIMO channels which can be individually processed. This reduces computational complexity. Elementary orthogonal sub-channels of each sub-carrier, obtained by using SVD (singular value decomposition) of a channel matrix at each sub-carrier, can also be called eigenmodes.
The embodiments are not, however, restricted to the system given as an example but a person skilled in the art may apply the solution in other systems provided with the necessary properties.
FIG. 1 is a simplified illustration of a digital data transmission system to which the solution according to the invention is applicable. This is a part of a cellular radio system, which comprises a base station or an equivalent network element 100, which has bi-directional radio links 102 and 104 to subscriber terminals 106 and 108. The subscriber terminals may be fixed, vehicle-mounted or portable. The base station includes transmitters, for instance. From the transceivers of the base station there is a connection to an antenna unit, which establishes the bi-directional radio links to the subscriber terminal. The base station is further connected to a base station controller or an equivalent network element 110, which transmits the connections of the terminals to the other parts of the network. The base station controller controls in a centralized manner several base stations connected to it.
The cellular radio system can also communicate with other networks such as a public switched telephone network or the Internet.
If a transmitter has some knowledge about CSI (channel state information) the spectral efficiency can be increased by applying adaptive transmission techniques. In a TDD (time division duplex) based system, the channel can be estimated at the base station on the basis of a signal received in one or more selected previous uplink timeslots. The estimate may be used for link adaptation during the next down link timeslot. The link adaptation consists of modifying transmission parameters according to channel variation in order to maximise the throughput using at most the maximum transmission power and fulfilling requirements set for the reliability of the transmission. Typically, the reliability is evaluated in terms of frame error rate (FER) or bit error rate (BER).
The transmitter typically informs the receiver about the chosen transmission parameters, for instance selected eigenmodes, constellations, powers allocated to the eigenmodes and channel code parameters, using a signalling channel. The signalling overhead reduces effective capacity of the downlink channel, thus the target is to minimize it for making the usage of available capacity more efficient.
Next, by the aid of FIG. 2, let us examine in further detail an embodiment of the data loading method (or algorithm). The example system used here includes two receiver antennas and at least two transmitting antennas. The scheme exploits radio channel reciprocity of TDD (time division duplex) transmission and operates in an open loop adaptation mode. Typically, for each transmitted frame, in order to maintain the selected frame error rate (FER) under the total transmitted power constraint, the modulation scheme and the allocated power to each eigenmode are adapted according to channel conditions.
If a channel is known at a transmitter side, the channel matrix can be decomposed for each sub-carrier using SVD (singular value decomposition). As a result a set of orthogonal sub-channels is obtained in the space domain. These elementary sub-channels are also called in this application eigenmodes.
For such a scenario, the optimal signalling in terms of channel capacity is usually eigenmode transmission, where a complex symbol is allocated to each eigenmode and the transmission power is allocated to the eigenmodes according to, for instance, a prior art water filling algorithm or modified water filling algorithm. The modified water filling algorithm is explained later in further detail. The process of adapting power and the amount of information to be allocated to each eigenmode is called here bit and power loading. The amount of information to be allocated to the eigenmodes varies according to the modulation level such as complex signal constellation and/or the channel coding parameters such as code rate. MIMO-OFDM eigenmode transmission is described in Kai-Kit Wong, Roger S. K. Cheng, Khaled Ben Letaief and Ross D. Murch: Adaptive Spatial-Subcarrier Trellis Coded MQAM and Power Optimization for OFDM transmissions, Proceeding of IEEE Vehicular Technology Conference, vol. 3, pp. 2049-2053, 2000, H. Sampath, P. Stoica and Arogyaswami J. Pauiraj: Generalized linear precoder and decoder design for MIMO channels using the weighted MMSE criterion, IEEE Trans on Communications, vol. 49, no. 12, pp. 2198-2206, December 2001.
The embodiment of the method provides reduced signalling overhead in relation to the number of sub-carriers by grouping eigenmodes into preferably two clusters and using the same modulation and coding scheme (MCS) for all selected eigenmodes belonging to the same cluster. The clusters preferably include the strongest and the weakest eigenmodes of each sub-carrier.
The embodiment starts in block 200.
In block 202, a channel matrix is estimated.
An estimate of the channel matrix (Ĥc) at each sub-carrier c is provided:

Ĥc=Hc+Nc  (1)

wherein
c means a sub-carrier and
Ĥc means the estimated channel matrix and
Hc means the true value of channel matrix and
Nc means the means channel estimation error with the entries modelled as independent Gaussian random variables with zero mean and variance σN2.
Channel estimation is typically made according to selected prior art method. The channel estimation is usually based on pilot signals of the reversed frame. Variance of the error of the channel estimation (σN2) is typically also estimated using an appropriate prior art method. Channel estimation is well known in prior art and therefore it is not explained here in further detail.
In block 204, singular value decomposition (SVD) of the estimated channel matrix is calculated. As a result the eigenvalues of the estimated channel matrix are obtained. Singular value decomposition is calculated typically independently for each sub-carrier.
The SVD of the estimated channel matrix is given by:

Ĥc=Ûc{circumflex over (Λ)}cVcH,  (2)

wherein
c means sub-carrier and
Ûc is an RXR (R=the number of receiver antennas equal with 2 in this example) unitary matrix contains in its columns left singular vectors of the channel matrix and
{circumflex over (V)}c is an TXT (T=the number of transmitter antennas≧2 in this example) unitary matrix contains in its columns right singular vectors of the channel matrix and
{circumflex over (V)}cH means the transpose and complex conjugate (hermitian) of the matrix {circumflex over (V)}c and
{circumflex over (Λ)}c is an RXT (R=the number of receiver antennas equal with 2 in this example, T=the number of transmitter antennas) dimensional matrix having the elements √{square root over ({circumflex over (λ)}1,c)}, √{square root over ({circumflex over (λ)}2,c)} on the main diagonal and all other elements being zeros; the elements on the main diagonal are descending ordered √{square root over ({circumflex over (λ)}1,c)}, √{square root over ({circumflex over (λ)}2,c)}.
The matrix {circumflex over (V)}c is also used for linear pre-filtering of the signal transmitted at a sub-carrier c in order to obtain eigemodes. Due to the channel estimation errors orthogonality between the resulted eigenmodes in each sub-carrier is usually lost. Therefore a spatial equalizer is required at the receiver side for each sub-carrier. The spatial equalizer can be implemented either in zero forcing or linear minimum mean square structure. The equalization is well known in prior art and therefore it is not explained here in further detail.
If the channel estimation is fairly accurate (channel estimation errors smaller than 10%), the instantaneous signal to noise ratio at the equalizer output can be approximated by:




  
    
      
        
          
            SNR
            
              i
              ,
              c
            
          
          ≈
          
            
              
                P
                
                  i
                  ,
                  c
                
              
              
                N
                0
              
            
            ⁢
            
              λ
              
                i
                ,
                c
              
            
            ⁢
            
              
                
                
                  
                    
                      v
                      ^
                    
                    
                      i
                      ,
                      c
                    
                    H
                  
                  ⁢
                  
                    v
                    
                      i
                      ,
                      c
                    
                  
                
                
              
              2
            
          
        
        ,
      
    
    
      
        (
        3
        )
      
    
  




wherein
c means sub-carrier and
i means the spatial sub-channel (eigenmode) index for a given sub-carrier and
N0 means the power spectral density of noise at the receiver side and
Pi,c means the power allocated at the eigenmode (i,c) and
λi,c means the square of the i'th singular value of the true channel matrix Hc.
{circumflex over (v)}i,c is the i'th right singular vector of the estimated channel matrix Ĥc and is given by the i'th column of matrix {circumflex over (V)}c and
{circumflex over (v)}i,cH means the transpose and complex conjugate (hermitian) of the vector {circumflex over (v)}i,c and
vi,c is the i'th right singular vector of the true channel matrix Hc.
The term |{circumflex over (v)}i,cHvi,c|2 in equation (3) represents the loss in SNR due to the channel estimation errors. It's instantaneous values are difficult to calculate but it was found by simulations that:




  
    
      
        
          
            E
            
              N
              c
            
          
          ⁢
          
            {
            
              
                
                  
                  
                    
                      
                        v
                        ^
                      
                      
                        i
                        ,
                        c
                      
                      H
                    
                    ⁢
                    
                      v
                      
                        i
                        ,
                        c
                      
                    
                  
                  
                
                2
              
              ⁢
              
                
                  
                    λ
                    ^
                  
                  
                    i
                    ,
                    c
                  
                
                
                  λ
                  
                    i
                    ,
                    c
                  
                
              
            
            }
          
        
        ≈
        1
      
    
    
      
        (
        4
        )
      
    
  




wherein
c means sub-carrier and
i means the spatial sub-channel (eigenmode) index for a given sub-carrier and
ENc { } means the statistical expectation operator, where the expectation is taken with respect of probability density function of Nc elements (Nc is the channel estimation error) and
λi,c means the square of the i'th singular value of the true channel matrix Hc and
{circumflex over (λ)}i,c means the square of the i'th singular value of the estimated channel matrix Ĥc.
Based on relations (3) and (4), the average SNR (signal-to-noise ratio) loss can be compensated by increasing the instantaneous allocated power to each eigenmode with the ratio




  
    
      
        λ
        ^
      
      
        i
        ,
        c
      
    
    
      λ
      
        i
        ,
        c
      
    
  
  .




To implement this we need a reliable estimate of the λi,c. Eigenvalues are squares of the singular values of the channel matrix obtained by SVD.

In practise, the channel matrix itself cannot determine. Instead of the real channel matrix, the estimate is used. Correspondingly, also for eigenvalues estimates are used.
The main idea of the method is to partially compensate the bias between {circumflex over (λ)}i,c and λi,c. Notice that λi,c are the eigenvalues of the hermitian matrix HcHcH and {circumflex over (λ)}i,c are the eigenvalues of the hermitian matrix ĤcĤcH.
Let's denote the entries in the 2×2 hermitian matrix HcHcH as follows:




  
    
      
        
          
            H
            c
          
          ⁢
          
            H
            c
            H
          
        
        =
        
          [
          
            
              
                
                  a
                  c
                
              
              
                
                  b
                  c
                
              
            
            
              
                
                  b
                  c
                  *
                
              
              
                
                  c
                  c
                
              
            
          
          ]
        
      
    
    
      
        (
        5
        )
      
    
  




wherein
ac,bc,bc*,cc represent matrix elements and
* means a complex conjugate.
By solving the characteristic equation of the matrix HcHcH the eigenvalues are given by:




  
    
      
        
          
            
              
                λ
                
                  1
                  ,
                  c
                
              
              =
              
                
                  1
                  2
                
                ⁢
                
                  (
                  
                    
                      a
                      c
                    
                    +
                    
                      c
                      c
                    
                    +
                    
                      
                        
                          
                            (
                            
                              
                                a
                                c
                              
                              -
                              
                                c
                                c
                              
                            
                            )
                          
                          2
                        
                        +
                        
                          4
                          ⁢
                          
                            
                              
                              
                                b
                                c
                              
                              
                            
                            2
                          
                        
                      
                    
                  
                  )
                
              
            
          
        
        
          
            
              
                λ
                
                  2
                  ,
                  c
                
              
              =
              
                
                  1
                  2
                
                ⁢
                
                  (
                  
                    
                      a
                      c
                    
                    +
                    
                      c
                      c
                    
                    -
                    
                      
                        
                          
                            (
                            
                              
                                a
                                c
                              
                              -
                              
                                c
                                c
                              
                            
                            )
                          
                          2
                        
                        +
                        
                          4
                          ⁢
                          
                            
                              
                              
                                b
                                c
                              
                              
                            
                            2
                          
                        
                      
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




wherein
ac,bc,cc are defined in (5) and
| | means absolute value.
The estimated channel matrix Ĥc multiplied with its' transpose complex-conjugate (Hermitian) ĤcH matrix is expressed as follows:




  
    
      
        
          
            
              H
              ^
            
            c
          
          ⁢
          
            
              H
              ^
            
            c
            H
          
        
        =
        
          [
          
            
              
                
                  
                    a
                    ^
                  
                  c
                
              
              
                
                  
                    b
                    ^
                  
                  c
                
              
            
            
              
                
                  
                    b
                    ^
                  
                  c
                  *
                
              
              
                
                  
                    c
                    ^
                  
                  c
                
              
            
          
          ]
        
      
    
    
      
        (
        7
        )
      
    
  




wherein
âc, {circumflex over (b)}c, {circumflex over (b)}c*, ĉc represent matrix elements and
* means a complex conjugate.
The eigenvalues of ĤcĤcH are given by:




  
    
      
        
          
            
              
                
                  λ
                  ^
                
                
                  1
                  ,
                  c
                
              
              =
              
                
                  1
                  2
                
                ⁢
                
                  (
                  
                    
                      
                        a
                        ^
                      
                      c
                    
                    +
                    
                      
                        c
                        ^
                      
                      c
                    
                    +
                    
                      
                        
                          
                            (
                            
                              
                                
                                  a
                                  ^
                                
                                c
                              
                              -
                              
                                
                                  c
                                  ^
                                
                                c
                              
                            
                            )
                          
                          2
                        
                        +
                        
                          4
                          ⁢
                          
                            
                              
                              
                                
                                  b
                                  ^
                                
                                c
                              
                              
                            
                            2
                          
                        
                      
                    
                  
                  )
                
              
            
          
        
        
          
            
              
                
                  λ
                  ^
                
                
                  2
                  ,
                  c
                
              
              =
              
                
                  1
                  2
                
                ⁢
                
                  (
                  
                    
                      
                        a
                        ^
                      
                      c
                    
                    +
                    
                      
                        c
                        ^
                      
                      c
                    
                    -
                    
                      
                        
                          
                            (
                            
                              
                                
                                  a
                                  ^
                                
                                c
                              
                              -
                              
                                
                                  c
                                  ^
                                
                                c
                              
                            
                            )
                          
                          2
                        
                        +
                        
                          4
                          ⁢
                          
                            
                              
                              
                                
                                  b
                                  ^
                                
                                c
                              
                              
                            
                            2
                          
                        
                      
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




wherein
âc,{circumflex over (b)}c,ĉc are defined in (7) and
| | means absolute value.
In block 206, biases between eigenvalues λi,c and their estimates {circumflex over (λ)}i,c are defined for channel estimation reliability test and the channel estimation reliability test is performed.
The biases between eigenvalues λi,c and their estimates {circumflex over (λ)}i,c, the terms of expressions (6) and (8), can be calculated by:

B1=ENc{âc−ac}=TσN2

B2=ENc{ĉc−cc}=TσN2

B3ENc{|{circumflex over (b)}c|2−|bc|2}=σN2∥Hc∥F2+TσN4

B4=ENc{(âc−ĉc)2−(ac−cc)2}=4σN4∥Hc∥F2+2TσN4  (9)

wherein
B1, B2, B3, B4 are the bias terms and
ac,bc,cc are defined in (5) and
âc,{circumflex over (b)}c,ĉc are defined in (7) and
ENc { } means the statistical expectation operator, where the expectation is taken with respect of probability density function of Nc (Nc is the channel estimation error) and
T is the number of transmission antennas and
σN2 is variance of the error of the channel estimation and
∥Hc∥F2 means the square of the Frobenius norm of channel matrix Hc and it is given by ∥Hc∥F2=ac+cc.
From (9) is clear that for computing bias terms B3 and B4 we need first to estimate the square of the Frobenius norm of the channel matrix Hc. An instantaneous consistent estimate is given by:

 ∥Hc∥F2=âc+ĉc−B1−B2=âc+ĉc−2TσN2  (10)

Based on this estimate a test for the channel estimation reliability evaluation is carried out for each sub-carrier as follows:

if ( ∥Hc∥F2>0)  (11)

    
    
        the sub-carrier c will be used in the loading algorithm else
        the sub-carrier c will be discarded from the loading algorithm.
    
    


In block 208, bias compensation is carried out for eigenvalue estimates {circumflex over (λ)}i,c.
For the eigenvalue estimation the bias terms given by (9) are used to partially compensate the bias in the terms of expression (8) as follows:




  
    
      
        
          
            
              
                
                  λ
                  ^
                
                
                  1
                  ,
                  c
                
              
              =
              
                
                  1
                  2
                
                ⁢
                
                  (
                  
                    
                      
                        (
                        
                          
                            
                              a
                              ^
                            
                            c
                          
                          -
                          
                            B
                            1
                          
                        
                        )
                      
                      +
                    
                    +
                    
                      
                        (
                        
                          
                            
                              c
                              ^
                            
                            c
                          
                          -
                          
                            B
                            2
                          
                        
                        )
                      
                      +
                    
                    +
                  
                
              
            
          
        
        
          
            
              
                
              
              ⁢
              
                
                  
                    
                      [
                      
                        
                          
                            (
                            
                              
                                
                                  a
                                  ^
                                
                                c
                              
                              -
                              
                                
                                  c
                                  ^
                                
                                c
                              
                            
                            )
                          
                          2
                        
                        -
                        
                          
                            B
                            _
                          
                          3
                        
                      
                      ]
                    
                    +
                  
                  +
                  
                    
                      4
                      [
                      
                        
                          
                            
                            
                              
                                b
                                ^
                              
                              c
                            
                            
                          
                          2
                        
                        -
                        
                          
                            B
                            _
                          
                          4
                        
                      
                      ]
                    
                    +
                  
                
              
              )
            
          
        
      
    
    
      
        (
        12
        )
      
    
  
  
    
      
        
          
            λ
            ^
          
          
            2
            ,
            c
          
        
        =
        
          
            1
            2
          
          ⁢
          
            (
            
              
                
                  (
                  
                    
                      
                        a
                        ^
                      
                      c
                    
                    -
                    
                      B
                      1
                    
                  
                  )
                
                +
              
              +
              
                
                  (
                  
                    
                      
                        c
                        ^
                      
                      c
                    
                    -
                    
                      B
                      2
                    
                  
                  )
                
                +
              
              -
              
                
                  
                    
                      (
                      
                        
                          
                            a
                            ^
                          
                          c
                        
                        -
                        
                          
                            c
                            ^
                          
                          c
                        
                      
                      )
                    
                    2
                  
                  +
                  
                    4
                    ⁢
                    
                      
                        
                        
                          
                            b
                            ^
                          
                          c
                        
                        
                      
                      2
                    
                  
                
              
            
            )
          
        
      
    
    
      
        
      
    
  




wherein
B1,B2 are the bias terms given by (9) and
(x)+ means the positive value of x defined as: (x)+=max (x, 0) and

    
    
         B3 and B4 represents the estimates of B3 and B4; they are obtained by replacing ∥Hc∥F2 in (9) with its instantaneous estimate ∥Hc∥F2 given by (10).
    
    


For smaller eigenvalues ({tilde over (λ)}2,c in equation (12)), the terms, which are under the square root are left uncompensated. This produces a slight underestimation of the eigenvalue causing increasing in system robustness. The eigenmodes corresponding to the eigenvalues which become negative after bias compensation, are discarded from the loading algorithm.
In block 210, the equivalent power gain is calculated.
By using the estimated eigenvalues (12) in (4) and combining with (3) we can express the equivalent power gain at the eigenmode (i,c) as follows:




  
    
      
        
          g
          
            i
            ,
            c
          
        
        =
        
          
            
              λ
              ~
            
            
              i
              ,
              c
            
            2
          
          
            
              λ
              ^
            
            
              i
              ,
              c
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




Clearly, in case of perfect channel estimation at the transmitter side the equivalent power gain become the square of the singular value of the channel matrix




  (
  
    
      g
      
        i
        ,
        c
      
    
    ⁢
    
      
    
    ⁢
    
      ⟶
      
        
          σ
          N
          2
        
        →
        0
      
    
    ⁢
    
      
    
    ⁢
    
      λ
      
        i
        ,
        c
      
    
  
  )




as is known from the prior art.

An eigenmode is an elementary sub-channel created within one sub-carrier by using SVD of the channel matrix at that sub-carrier. The eigenmodes are obtained by pre-filtering the transmitted signal with the right hand singular vector matrix.
The power required at the eigenmode (i,c) in order to obtain a given target signal to noise ratio, SNRl, is given by:




  
    
      
        
          
            
              P
              ~
            
            
              i
              ,
              c
            
          
          ⁡
          
            (
            
              SNR
              t
            
            )
          
        
        =
        
          
            SNR
            t
          
          ⁢
          
            
              N
              0
            
            
              g
              
                i
                ,
                c
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




In the following, we will describe the bit and power loading part of the data loading method, using as an example a system with two receiving antennas and at least two transmitter antennas. The number of eigenmodes obtained in each sub-carrier is given by the minimum between the number of transmit and receive antennas (two in the considered example).
Briefly, the main idea of the method is to exploit the intrinsic spatial diversity achieved by using MIMO-OFDM transmission. In the following we present one embodiment based on turbo channel coding but it is clear to a person skilled in the art that turbo codes may be replaced by other prior art channel coding methods.
In block 212, eigenmodes are arranged into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels.
In one embodiment, 2C eigenmodes (C meaning the total number of sub-carriers) are grouped into two clusters, consisting of the strongest and the weakest eigenmodes from each sub-carrier, respectively. Except some eigenmodes corresponding to the most faded sub-carriers, a small difference between the eigenmodes gains belonging to the same cluster is experienced due to spatial diversity. Consequently, by skipping some of the most faded eigenmodes, the same MCS (modulation and coding scheme) can be used for all selected eigenmodes belonging to the same cluster and the required signalling overhead is C times reduced.
In one embodiment, each cluster is independently encoded by using single input single output (SISO) turbo code. The resulted bits are usually also interleaved and modulated. For each cluster the encoding is performed jointly in time and frequency domain, a codeword covering the selected eigenmodes from one cluster during whole transmitted frame. In this way the codeword is enlarged to achieve interleaving gain while the adaptability between clusters is still preserved.
The modulation and coding parameters (for example the complex constellation used in modulation, the coding rate) are modified according to channel conditions in order to maintain the target FER (frame error rate). Specifically, there are available a set of K distinct modulation and coding schemes (MCS), and we denote them by bk, k=1, . . . , K, the spectral efficiency being provided by k'th MCS.
For each available MCS, the required SNR to achieve the target FER in additive white Gaussian noise (AWGN) channel can be obtained analytically or by preliminary simulations and the results can be stored into a look up table.
Let's denote by γk, k=1, . . . , K the SNR required by the k'th MCS to achieve the target FER in AWGN channel. We assume that bk are given in the ascending order b1<b2< . . . <bK and for an efficient MCS set is required that γ1<γ2< . . . <γK.
For each transmitted frame, first, the total power is divided between the clusters according with their capacities, and then, the MCS and the selected eigenmodes in each cluster are independently optimized to maximize the throughput subject to equal SNR constraint for all selected eigenmodes.
Thus, in block 214, transmission power is pre-allocated to the eigenmodes according to their capacity by using the calculated equivalent power gain.
In practise, the amount of information allocated to an eigenmode is limited not only by the noise power but also by the maximum rate achieved by the most spectral efficient MCS (modulation and coding scheme). Therefore, in power allocation, instead of prior art water filling a modified water filling method can be used for taking into account the saturation of signal-to-noise ratio of the eigenmode and the average signal-to-noise ratio gap.
In the modified water filling, the power to be pre-allocated for an eigenmode is expressed:




  
    
      
        
          
            P
            
              i
              ,
              c
            
            
              (
              MWF
              )
            
          
          =
          
            min
            ⁡
            
              [
              
                
                  
                    (
                    
                      μ
                      -
                      
                        
                          
                            N
                            0
                          
                          
                            g
                            
                              i
                              ,
                              c
                            
                          
                        
                        ⁢
                        G
                      
                    
                    )
                  
                  +
                
                ,
                
                  
                    
                      N
                      0
                    
                    
                      g
                      
                        i
                        ,
                        c
                      
                    
                  
                  ⁢
                  
                    γ
                    K
                  
                
              
              ]
            
          
        
        ,
      
    
    
      
        (
        15
        )
      
    
  




wherein
MWF means modified water filling
i is a cluster index,
c is a carrier index,
N0 means spectral density of noise at the receiver,
G is the average signal-to-noise ratio gap between the Shannon capacity and the spectral efficiency provided by the MCS set,
(x)+ means the positive value of x defined as: (x)+=max (x, 0) and
γK means the SNR required by the most spectral efficient MCS to achieve the target FER in AWGN (Additive White Gaussian Noise) channel
gi,c means the equivalent power gain at the eigenmode (i,c) given by (13)
μ means the “water level” and it is found from the maximum transmit power constraint:




  
    
      
        
          
            ∑
            
              i
              =
              1
            
            2
          
          ⁢
          
            
              ∑
              
                c
                =
                1
              
              C
            
            ⁢
            
              
            
            ⁢
            
              P
              
                i
                ,
                c
              
              
                (
                MWF
                )
              
            
          
        
        =
        
          P
          T
        
      
    
    
      
        (
        16
        )
      
    
  




wherein
PT means the maximum transmit power
C means the total number of sub-carriers.
When the modified water filling method described above is used, less power is allocated to some eigenmodes than if the prior art water filling method was used. These eigenmodes are called saturated eigenmodes because although the amount of allocated power can be increased, the amount of information transmitted using these eigenmodes has already reached the maximum e.g. is saturated.
In block 216, based on the power pre-allocation of block 214, collective power to be allocated to each cluster is determined. The collective power allocated to a cluster can be expressed as follows:




  
    
      
        
          
            P
            i
          
          =
          
            
              ∑
              
                c
                =
                1
              
              C
            
            ⁢
            
              
            
            ⁢
            
              P
              
                i
                ,
                c
              
              
                (
                MWF
                )
              
            
          
        
        ,
      
    
    
      
        (
        17
        )
      
    
  




wherein
C means the number of sub-carriers,
c is the current sub-carrier,
Σ means a summing operation and
Pi,c(MWF) is obtained from equation (15).
In block 218, transmission power is allocated to the eigenmodes and the optimum modulation and coding scheme (MCS) is selected for each cluster.
The clusters are independently optimised by searching for the MCS that provides maximum throughput when the collective power Pi is allocated to the eigenmodes according to the target FER (frame error rate), under equal signal-to-noise constraint. This is, in practise, typically equivalent with the maximisation over the MCS set of the product between the maximum number of eigenmodes selectable using a certain MCS and the spectral efficiency provided by that MCS.
The maximisation is preferably applied in the same manner to each cluster. Therefore the cluster index (I) is omitted for brevity. By denoting with P the collective power allocated to the cluster, the index of the optimum MCS, k0, which maximises the throughput under the total transmitted power and the maximum FER constraints can be written as:




  
    
      
        
          
            k
            0
          
          =
          
            
              
                
                  
                    arg
                    ⁢
                    
                      
                    
                    ⁢
                    max
                  
                  ⁢
                  
                    
                  
                
                
                  
                    k
                    =
                    1
                  
                  ,
                  2
                  ,
                  
                    
                  
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ,
                  K
                
              
              ⁢
              
                
                  b
                  k
                
                (
                
                  
                    max
                    
                      S
                      ⋐
                      
                        
                          
                            {
                            
                              1
                              ,
                              2
                              ,
                              
                                
                              
                              ⁢
                              ...
                              ⁢
                              
                                
                              
                              ,
                              C
                            
                            }
                          
                          ⁢
                          
                            :
                          
                          ⁢
                          
                            
                              ∑
                              
                                c
                                ∈
                                S
                              
                            
                            ⁢
                            
                              
                                
                                  P
                                  ~
                                
                                c
                              
                              ⁡
                              
                                (
                                
                                  γ
                                  k
                                
                                )
                              
                            
                          
                        
                        ≤
                        P
                      
                    
                  
                  ⁢
                  
                    
                    S
                    
                  
                
                )
              
            
            =
            
              arg
              ⁢
              
                
              
              ⁢
              
                
                  
                    
                  
                  ⁢
                  max
                
                k
              
              ⁢
              
                
              
              ⁢
              
                b
                k
              
              ⁢
              
                s
                k
              
            
          
        
        ,
      
    
    
      
        (
        18
        )
      
    
  




wherein
S is a subset of the set of eigenmode indexes with cardinality |S|,
sk represents the maximum number of eigenmodes that can be selected using the k'th modulation scheme,




  
    
      
        P
        ~
      
      c
    
    ⁡
    
      (
      
        γ
        k
      
      )
    
  
  ⁢
  
    
  
  ⁢
  is
  ⁢
  
    
  
  ⁢
  given
  ⁢
  
    
  
  ⁢
  by
  ⁢
  
    
  
  ⁢
  
    (
    14
    )
  
  ⁢
  
    
  
  ⁢
  
    (
    
      
        γ
        k
      
      ⁢
      
        
          N
          0
        
        
          g
          c
        
      
    
    )
  




C means the number of carriers,
c is the current carrier,
bk means the spectral efficiency (number of bits per transmitted complex symbol) provided by k'th MCS.
The values sk can be calculated using the following algorithm:
Step1: arranging in a descending order the equivalent eigenmode power gains gc. The arranging process means mathematically that the indexes vector

j=[j1,j2, . . . , jC],  (19)

such that gj1>gj2> . . . >gjC is found.
Step2: computing the vector w=[w1,w2, . . . , wC], with each entry given by




  
    
      
        
          
            w
            c
          
          =
          
            
              N
              0
            
            ⁢
            
              
                ∑
                
                  n
                  =
                  1
                
                c
              
              ⁢
              
                
              
              ⁢
              
                1
                
                  g
                  
                    j
                    n
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        20
        )
      
    
  




wherein
N0 means the power spectral density of noise at the receiver side an
c is the index of the entry and
n means the summation index,
jn means the n'th entry in the indexes vector j given by (19)
gjn means the equivalent power gain of the jn'th eigenmode in the current cluster
Σ means the summing operation.
Step 3: Let s0=C and γ0=0. For k=1 to K, let sk=sk−1 and if wskγk>P decrease the number of selected eigenmodes, sk=sk−1, until the power constraint, wskγk<P, is satisfied. Every time when the power constraint is satisfied the corresponding value sk is saved.
Using the values sk provided by the previously presented algorithm, the optimum MCS, k0, is found by using (18) and the powers allocated to the cluster's eigemodes are computed based on (14) as follows:




  
    
      
        
          P
          
            j
            n
          
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        P
                        ~
                      
                      
                        j
                        n
                      
                    
                    ⁡
                    
                      (
                      
                        γ
                        
                          k
                          0
                        
                      
                      )
                    
                  
                  =
                  
                    
                      γ
                      
                        k
                        0
                      
                    
                    ⁢
                    
                      
                        N
                        0
                      
                      
                        g
                        
                          j
                          n
                        
                      
                    
                  
                
              
              
                if
              
              
                
                  n
                  ≤
                  
                    s
                    
                      k
                      0
                    
                  
                
              
            
            
              
                0
              
              
                if
              
              
                
                  n
                  >
                  
                    s
                    
                      k
                      0
                    
                  
                
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




wherein
jn means the n'th entry in the indexes vector j given by (19)
Pjn means the power allocated to the jn'th eigenmode in the current cluster
k0 means the index of the selected MCS in the current cluster
γk0 means the SNR required by the selected MCS (k0) at the current cluster to achieve the target FER in AWGN channel
sk0 means the number of the selected eigenmodes in the current cluster
If correlation between antennas is strong and/or signal-to-noise-ration is low, it is possible that the number of selected eigenmodes at the weakest cluster is small and the resulted code word is very short. In such a case, the performance of codes may decrease and the target FER (frame error rate) is not maintained. In this case, the weakest cluster is not used and the power pre-allocated to the weakest cluster is reused by the strongest cluster. The arrow 224 depicts this procedure.
The method ends in block 220. The arrow 222 depicts one possibility of repeating the method.
Next, an example of a transmitter structure according to an embodiment of the data loading method described above is depicted in further detail by the aid of FIG. 3. It is obvious for a skilled person that the structure of a transmitter may vary from what is depicted in FIG. 3.
The present invention can be applied in various wireless communication systems based on MIMO-OFDM. One example of such a communication system is IEEE 802.11 a wireless LAN communication system. In FIG. 3, there is depicted only a part of an OFDM transmitter focusing on the transmitter blocks required by the loading method. It is obvious to a person skilled in the art that the transmitter may also include elements other than those illustrated in FIG. 3.
The transmitter described here is thought to be constructed of two parts: of pre-processor 318 and of OFDM-modulator 320. The data loading method described above with the aid of FIG. 2 is carried out mainly in bit and power loading block 304 which is a part of the pre-processor 318.
The embodiment of the data loading method described above is based on that the transmitter has prior knowledge of the radio channel. The radio channel can be estimated at a receiver being coupled to the transmitter on the basis of one or more signals received in selected previous timeslots. The link adaptation consists of modifying transmission parameters according to channel variation in order to maximise the throughput using at most the maximum transmission power and fulfilling requirements set for the reliability of the transmission. Typically, the reliability is evaluated in terms of frame error rate (FER) or bit error rate (BER).
The receiver being coupled to the transmitter is not depicted in FIG. 3 for the sake of clarity. The receiver is in this embodiment a prior art MIMO-OFDM receiver.
The transmitter typically informs the receiver about the chosen transmission parameters, for instance selected eigenmodes, constellations, powers allocated to the eigenmodes and channel code parameters, using a signalling channel.
Channel estimation block 300 carries out channel estimation for singular value decomposition SVD which in turn is carried out in block 302. Both the channel estimation and SVD are described above with the aid of FIG. 2.
Encoding and interleaving blocks 306A-306B carry out channel coding, interleaving and modulation. In one embodiment, channel coding is carried out by encoding each cluster independently by using a single input single output (SISO) turbo code. For each cluster the encoding is performed jointly in time and frequency domain, a codeword covering the selected eigenmodes from one cluster during whole transmitted frame. In this way the codeword is enlarged to achieve interleaving gain while the adaptability between clusters is still preserved. The resulted bits are usually also interleaved and modulated using some prior art interleaving and modulation methods.
In the linear pre-combining blocks 310A-310B, the complex symbols generated in the blocks 306A-306B are scaled according to the powers allocated to each eigenmodes in block 304 and then the transmitted signal at each sub-carrier is filtered with the right hand singular matrix {circumflex over (V)}c (see FIG. 2, block 204). The number of pre-combining blocks is equal to the number of sub-carriers.
In OFDM-modulator of the example of FIG. 3, an IFFT is carried out in IFFT blocks 312A-312B. It is obvious to a skilled person that the number of blocks may vary according to the implementation. Typically, it is equal to the number of transmit antennas. Then, in blocks 314A-314B, the signal is converted from parallel to serial form and a cyclic prefix is added.
The OFDM-signal is then conveyed via a DAC (digital-to-analogue converter) to the antenna 316A-316B. The number of antennas vary according to the implementation. In MIMO systems, there are several antennas.
OFDM-systems are well known in the art.
Even though the invention is described above with reference to an example according to the accompanying drawings, it is clear that the invention is not restricted thereto but it can be modified in several ways within the scope of the appended claim.

## Claims

1. A data loading method in a communication system where sub-carriers include eigenmodes, the method comprising:
estimating a channel matrix;
calculating a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates;
defining biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases;
carrying out bias compensation for eigenvalue estimates based on the defined biases;
calculating equivalent power gain;
arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels;
pre-allocating transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain;
determining collective transmission power to be allocated to each cluster based on the pre-allocation; and
selecting the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.

2. The method of claim 1, wherein the number of clusters is two and each cluster includes the strongest and the weakest eigenmodes of each sub-carrier.

3. The method of claim 1, wherein the pre-allocation of transmission power is carried out by using water filling or modified water filling power allocation method.

4. The method of claim 1, wherein the communication system is a combined multiple-input-multiple output and orthogonal frequency division multiplexing system.

5. The method of claim 1, wherein the transmission power allocating to eigenmodes is started from the weakest cluster.

6. The method of claim 1, wherein the optimum modulation and coding scheme which maximizes the throughput under the total transmitted power and the maximum frame error rate constraints is found by using:




  
    k
    0
  
  =
  
    
      
        
          arg
          ⁢
          
            
          
          ⁢
          max
        
        
          
            k
            =
            1
          
          ,
          2
          ,
          
            
          
          ⁢
          ...
          ⁢
          
            
          
          ,
          K
        
      
      ⁢
      
        
          b
          k
        
        (
        
          
            max
            
              S
              ⋐
              
                
                  
                    {
                    
                      1
                      ,
                      2
                      ,
                      
                        
                      
                      ⁢
                      ...
                      ⁢
                      
                        
                      
                      ,
                      C
                    
                    }
                  
                  ⁢
                  
                    :
                  
                  ⁢
                  
                    
                      ∑
                      
                        c
                        ∈
                        S
                      
                    
                    ⁢
                    
                      
                        
                          P
                          ~
                        
                        c
                      
                      ⁡
                      
                        (
                        
                          γ
                          k
                        
                        )
                      
                    
                  
                
                ≤
                P
              
            
          
          ⁢
          
            
            S
            
          
        
        )
      
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          
            
              
            
            ⁢
            max
            ⁢
            
              
            
          
          k
        
        ⁢
        
          
            b
            k
          
          ⁢
          
            
              s
              k
            
            .

7. The method of claim 1, wherein the power required at the eigenmode (i,c) in order to obtain a given target signal to noise ratio, SNRt, is given by:




  
    
      
        P
        ~
      
      
        i
        ,
        c
      
    
    ⁡
    
      (
      
        SNR
        t
      
      )
    
  
  =
  
    
      SNR
      t
    
    ⁢
    
      
        
          N
          0
        
        
          g
          
            i
            ,
            c
          
        
      
      .

8. The method of claim 1, wherein according to the modified water filling, the power to be pre-allocated for an eigenmode is expressed:




  
    P
    
      i
      ,
      c
    
    
      (
      MWF
      )
    
  
  =
  
    
      min
      ⁡
      
        [
        
          
            
              (
              
                μ
                -
                
                  
                    
                      N
                      0
                    
                    
                      g
                      
                        i
                        ,
                        c
                      
                    
                  
                  ⁢
                  G
                
              
              )
            
            +
          
          ,
          
            
              
                N
                0
              
              
                g
                
                  i
                  ,
                  c
                
              
            
            ⁢
            
              γ
              K
            
          
        
        ]
      
    
    .

9. The method of claim 1, wherein the powers allocated to the cluster's eigenmodes are computed as follows:




  
    P
    
      j
      n
    
  
  =
  
    {
    
      
        
          
            
              
                
                  
                    P
                    ~
                  
                  
                    j
                    n
                  
                
                ⁡
                
                  (
                  
                    γ
                    
                      k
                      0
                    
                  
                  )
                
              
              =
              
                
                  γ
                  
                    k
                    0
                  
                
                ⁢
                
                  
                    N
                    0
                  
                  
                    g
                    
                      j
                      n
                    
                  
                
              
            
          
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                n
              
              ≤
              
                s
                
                  k
                  0
                
              
            
          
        
        
          
            0
          
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                n
              
              >
              
                s
                
                  k
                  0
                
              
            
          
        
      
      .

10. The method of claim 1, wherein the clusters are encoded.

11. A transmitter of a communication system where sub-carriers are divided into eigenmodes, the transmitter comprising:
an estimating unit configured to estimate a channel matrix;
a calculating unit configured to calculate a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates;
a defining unit configured to define biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases;
a carrying unit configured to carry out bias compensation for eigenvalue estimates based on the defined biases;
a gain calculating unit configured to calculate equivalent power gain;
an arranging unit configured to arrange eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels;
a pre-allocating unit configured to pre-allocate transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain;
a determining unit configured to determine collective transmission power to be allocated to each cluster based on the pre-allocation; and
a selecting unit configured to select the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.

12. The transmitter of claim 11, further comprising:
power pre-allocating unit configured to pre-allocate transmission power by using water filling or modified water filling power allocation method.

13. The transmitter of claim 11, wherein the communication system is a combined multiple-input-multiple output and orthogonal frequency division multiplexing system.

14. The transmitter of claim 11, further comprising:
an allocating unit configured to allocate transmission power to eigenmodes starting from the weakest cluster.

15. The transmitter of claim 11, further comprising:
a searching unit configured to search for the modulation and coding scheme which maximizes the throughput under the total transmitted power and the maximum frame error rate constraints can be written as





  
    k
    0
  
  =
  
    
      
        
          arg
          ⁢
          
            
          
          ⁢
          max
        
        
          
            k
            =
            1
          
          ,
          2
          ,
          ...
          ⁢
          
            
          
          ,
          K
        
      
      ⁢
      
        
          b
          k
        
        ⁡
        
          (
          
            
              max
              
                
                  S
                  ⋐
                  
                    {
                    
                      1
                      ,
                      2
                      ,
                      ...
                      ⁢
                      
                        
                      
                      ,
                      C
                    
                    }
                  
                
                :
                
                  
                    
                      ∑
                      
                        c
                        ∈
                        S
                      
                    
                    ⁢
                    
                      
                        
                          P
                          ~
                        
                        c
                      
                      ⁡
                      
                        (
                        
                          γ
                          k
                        
                        )
                      
                    
                  
                  ≤
                  P
                
              
            
            ⁢
            
              
              S
              
            
          
          )
        
      
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          max
          k
        
        ⁢
        
          
            b
            k
          
          ⁢
          
            
              s
              k
            
            .

16. The transmitter of claim 11, wherein the power required at the eigenmode (i,c) in order to obtain a given target signal to noise ratio, SNRt, is given by:




  
    
      
        P
        ~
      
      
        i
        ,
        c
      
    
    ⁡
    
      (
      
        SNR
        t
      
      )
    
  
  =
  
    
      SNR
      t
    
    ⁢
    
      
        
          N
          0
        
        
          g
          
            i
            ,
            c
          
        
      
      .

17. The transmitter of claim 11, wherein according to the modified water filling, the power to be pre-allocated for an eigenmode is expressed:




  
    P
    
      i
      ,
      c
    
    
      (
      MWF
      )
    
  
  =
  
    
      min
      ⁡
      
        [
        
          
            
              (
              
                μ
                -
                
                  
                    
                      N
                      0
                    
                    
                      g
                      
                        i
                        ,
                        c
                      
                    
                  
                  ⁢
                  G
                
              
              )
            
            +
          
          ,
          
            
              
                N
                0
              
              
                g
                
                  i
                  ,
                  c
                
              
            
            ⁢
            
              γ
              K
            
          
        
        ]
      
    
    .

18. The transmitter of claim 11, wherein the powers allocated to the cluster's eigemodes are computed as follows:




  
    P
    
      j
      n
    
  
  =
  
    {
    
      
        
          
            
              
                
                  
                    P
                    ~
                  
                  
                    j
                    n
                  
                
                ⁡
                
                  (
                  
                    γ
                    
                      k
                      0
                    
                  
                  )
                
              
              =
              
                
                  γ
                  
                    k
                    0
                  
                
                ⁢
                
                  
                    N
                    0
                  
                  
                    g
                    
                      j
                      n
                    
                  
                
              
            
          
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                n
              
              ≤
              
                s
                
                  k
                  0
                
              
            
          
        
        
          
            0
          
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                n
              
              >
              
                s
                
                  k
                  0
                
              
            
          
        
      
      .

19. The transmitter of claim 11, further comprising:
an encoding unit configured to encode clusters.

20. A transmitter of a communication system where sub-carriers are divided into eigenmodes, configured to
estimate a channel matrix,
calculate a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates,
define biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases,
carry out bias compensation for eigenvalue estimates based on the defined biases,
calculate equivalent power gain,
arrange eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels,
pre-allocate transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain,
determine collective transmission power to be allocated to each cluster based on the pre-allocation, and
select the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.

21. A base station of a communication system where sub-carriers are divided into eigenmodes, the base station comprising:
an estimating unit configured to estimate a channel matrix;
a calculating unit configured to calculate a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates;
a defining unit configured to define biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases;
a carrying unit configured to carry out bias compensation for eigenvalue estimates based on the defined biases;
a gain calculating unit configured to calculate equivalent power gain;
an arranging unit configured to arrange eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels;
a pre-allocating unit configured to pre-allocate transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain;
a determining unit configured to determine collective transmission power to be allocated to each cluster based on the pre-allocation; and
a selecting unit configured to select the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.

22. A base station of a communication system, where sub-carriers are divided into eigenmodes, configured to
estimate a channel matrix,
calculate a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates,
define biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases,
carry out bias compensation for eigenvalue estimates based on the defined biases,
calculate equivalent power gain,
arrange eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels,
pre-allocate transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain,
determine collective transmission power to be allocated to each cluster based on the pre-allocation, and
select the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.

23. A transmitter of a communication system where sub-carriers are divided into eigenmodes, the transmitter comprising:
estimating means for estimating a channel matrix;
calculating means for calculating a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates;
defining means for defining biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases;
carrying means for carrying out bias compensation for eigenvalue estimates based on the defined biases;
gain calculation means for calculating equivalent power gain;
arranging means for arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels;
pre-allocating means for pre-allocating transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain;
determining means for determining collective transmission power to be allocated to each cluster based on the pre-allocation; and
selecting means for selecting the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.

24. A base station of a communication system where sub-carriers are divided into eigenmodes, the base station comprising:
estimating means for estimating a channel matrix;
calculating means for calculating a singular value decomposition of the estimated channel matrix for obtaining eigenvalue estimates;
defining means for defining biases between eigenvalues and eigenvalue estimates and performing a channel estimation reliability test based on the defined biases;
carrying means for carrying out bias compensation for eigenvalue estimates based on the defined biases;
gain calculation means for calculating equivalent power gain;
arranging means for arranging eigenmodes into a predetermined number of clusters, each cluster comprising eigenmodes of different quality levels;
pre-allocating means for pre-allocating transmission power to the eigenmodes according to their capacity by using the calculated equivalent power gain;
determining means for determining collective transmission power to be allocated to each cluster based on the pre-allocation; and
selecting means for selecting the optimum modulation and coding scheme and allocating collective transmission power to the eigenmodes.