# Patent

## Title
Method and apparatus for sending and receiving channel state information in multiple-input multiple-output network wireless communication systems

## Abstract

A method and an apparatus for sending and receiving channel state information in network Multiple-Input Multiple-Output (MIMO) wireless communication systems are provided. Hybrid feedback technology is provided to transfer complete Channel State Information (CSI) to a transmitter by efficiently combining limited amounts of long-term channel information and short-term channel information are In a down link MIMO network system.

## Background
PRIORITY
This application is a Continuation Application of U.S. application Ser. No. 12/982,322, which was filed in the U.S. Patent and Trademark Office on Dec. 30, 2010, and claims priority under 35 U.S.C. §119(a) to Korean Patent Application No. 10-2009-0134817, which was filed in the Korean Intellectual Property Office on Dec. 30, 2009, the contents of each of which are incorporated herein by reference.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to a method and an apparatus for sending and receiving channel state information in network Multiple-Input Multiple-Output (MIMO) wireless communication systems, and more particularly, to a method and an apparatus for sending and receiving channel state information that transmit channel information to be divided into short-term channel information and long-term channel information and restoring full Channel State Information (CSI) in MIMO network wireless communication systems.
2. Description of the Related Art
A MIMO system has been suggested to provide data service of high speed and high equality in wireless communication where a transmitter and a receiver of the MIMO system have a plurality of antennas. Spatial processing is required in a transmitter and a receiver in MIMO technology. Accordingly, the transmitter and the receiver should have MIMO CSI between the transmitter and the receiver.
Specifically, the transmitter should have down link MIMO channel information from nT transmission antennas of a Base Transceiver Station (BTS) to nR reception antennas of an Access Terminal (AT) in a down link. Because a down link and an up link in a Frequency Division Multiplexing (FDM) system use different frequency domains, in order a BTS for having a down link CSI, a receiver should estimate a down link channel and feedback the estimated down link CSI to a transmitter. To feedback complete CSI to the transmitter, because transmission of much reverse link information is required, a user can use only minimum feedback information up to now.
As a result, to maximize system transmission capacity of a MIMO network, there is a need for research with respect to a feedback channel, a transceiver structure, and transmitting/receiving operations of technology transferring complete down link channel information to a transmitter using a limited amount of feedback information.
SUMMARY OF THE INVENTION
The present invention has been made in view of at least the above problems, and provides a method and an apparatus for sending and receiving channel state information that may transfer complete down link CSI to a BTS by efficiently combining a limited amount of long-term feedback information with a limited amount of short-term feedback information in a MIMO network wireless communication systems.
In accordance with an aspect of the present invention, a method for sending channel state information of a terminal in a network MIMO system having a plurality of base stations and the terminal, includes estimating a down link channel from a signal received from the base station; extracting long-term channel information from the extracted down link channel being in a state of a down link channel which does not instantaneously change in every frame and transmitting the long-term channel information through a long-term feedback channel divided and allocated into plural frames; and extracting short-term channel information from the extracted down link channel being in a state of a down link channel which instantaneously changes in every frame and transmitting the short-term channel information through a short-term feedback channel allocated every frame.
In accordance with another aspect of the present invention, a method for receiving channel state information of a network in a network MIMO system having a plurality of base stations and the terminal, includes receiving long-term channel information being in a state of a down link channel which does not instantaneously change in every frame through a long-term feedback channel allocated through a plurality of frames by one of the plurality of base stations; receiving short-term channel information being in a state of a down link channel which instantaneously changes in every frame to which a short-term feedback channel is allocated by the one base station; and combining the long-term channel information and the short-term channel information by the one base station to restore a channel matrix indicating a down link channel between the base station and the terminal.
In accordance with another aspect of the present invention, an apparatus for sending channel state information of a terminal in a network MIMO system having a plurality of base stations and the terminal, includes a transceiver performing data transmission and reception to and from the base station; a channel estimator estimating a down link channel from a signal received from the base station; a long-term channel information processor extracting long-term channel information from the extracted down link channel being in a state of a down link channel which does not instantaneously change in every frame and transmitting the long-term channel information through a long-term feedback channel divided and allocated into plural frames using the transceiver; and a short-term channel information processor extracting short-term channel information from the extracted down link channel being in a state of a down link channel which instantaneously changes in every frame and transmitting the short-term channel information through a short-term feedback channel allocated every frame using the transceiver.
In accordance with another aspect of the present invention, an apparatus for receiving channel state information of a network in a network MIMO system having a plurality of base stations and the terminal, includes a feedback receiver of one of the plurality of base stations receiving and restoring long-term channel information being in a state of a down link channel which does not instantaneously change in every frame through a long-term feedback channel allocated through a plurality of frames, and receiving and restoring short-term channel information being in a state of a down link channel which instantaneously changes in every frame through a short-term feedback channel allocated every frame; and a channel matrix restoring unit of the one base station combining the long-term channel information and the short-term channel information to restore a channel matrix indicating a down link channel between the base station and the terminal.
In the present invention as described above, a terminal may transmit long-term channel information according to a long-term feedback channel transmission period and short-term channel information according to a short-term feedback channel transmission period to reduce a load and restore complete CSI at the time of transmitting channel information.



BRIEF DESCRIPTION OF THE DRAWINGS
The above and other objects, features and advantages of the present invention will be more apparent from the following detailed description in conjunction with the accompanying drawings, in which:
FIG. 1 is a diagram illustrating a MIMO network system according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a schematic configuration of an apparatus for transmitting channel state information of a terminal according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a method for transmitting channel state information of a terminal according to an embodiment of the present invention;
FIG. 4 is a flowchart illustrating a method for transmitting channel state information of a terminal according to an embodiment of the present invention;
FIG. 5, FIG. 6A, and FIG. 6B are diagrams illustrating an apparatus for receiving transmitter channel state information according to an embodiment of the present invention;
FIG. 7 is a flowchart illustrating a method for receiving channel state information of a network according to an embodiment of the present invention;
FIG. 8 is a flowchart illustrating a method for receiving channel state information of a network according to an embodiment of the present invention; and
FIG. 9 is a graph comparing transmission capacities of an SM system according to full CSI feedback technology.



DETAILED DESCRIPTION OF EMBODIMENTS OF THE PRESENT INVENTION
Embodiments of the present invention are described with reference to the accompanying drawings in detail. The same reference numbers are used throughout the drawings to refer to the same or like parts. In addition, detailed descriptions of well-known functions and structures incorporated herein may be omitted to avoid obscuring the subject matter of the present invention.
The present invention provides technology that may transfer complete down link CSI to a transmitter by efficiently combining a limited amount of long-term feedback information with a limited amount of short-term feedback information in network MIMO wireless communication systems.
To feedback complete CSI according to an embodiment of the present invention, a down link MIMO channel matrix in each terminal is divided into a long-term eigen matrix which does not instantaneously change, a short-term gain matrix which instantaneously changes, and an output matrix, and the divided matrixes are quantized. The quantized eigen matrix is divided into plural frames, and the plural frames are transmitted through a long-term feedback channel to be transmitted for a long time, and the gain matrix and the output matrix are transmitted to a base station through a short-term feedback channel to be transmitted every frame.
In an embodiment of the present invention, a long-term feedback channel is a transmission resource allocated through a plurality of frames, and the present invention transmits long-term channel information to be divided into plural frames of the long-term feedback channel. The long-term channel information is CSI that does not change for at least one frame, which may become an eigen matrix.
Corresponding to the long-term feedback channel, in an embodiment of the present invention, a short-term feedback channel is a transmission resource allocated for every frame, and the present invention transmits short-term channel information every frame of the short-term feedback channel. The short-term channel information is channel state information that changes with every frame, which can become a gain matrix and an output matrix.
The base station may combine long-term and short-term channel information transmitted to be divided into a long-term feedback channel and a short-channel feedback to restore a channel matrix between a terminal and the base station, and restore a down link MIMO channel matrix between the terminal and plural base stations using the restored channel matrix and a channel state coefficient between base stations.
An embodiment of the present invention provides a code book for scalar quantization and vector quantization required for a channel matrix feedback, and a vector code book to quantize an inter-cell channel coefficient. Accordingly, an embodiment of the present invention provides a designed scalar code book by a non-uniform quantization in consideration of distribution of gain values according to the number of transmitting/receiving antennas and a channel environment for diagonal component quantization of a gain matrix. Furthermore, the present invention provides a vector code book designed such that vectors of the nR×1 size have isotropic distribution in an nR-dimensional complex vector space for a column vector quantization of an output matrix. The present invention provides a vector code book designed such that vectors of the size M×1 have isotropic distribution in an M-dimensional complex vector space for quantization of an inter-cell channel coefficient.
FIG. 1 is a diagram illustrating a MIMO network system according to an embodiment of the present invention.
Referring to FIG. 1, an embodiment of the present invention considers a Collaborative Base Transceiver Station (referred to as “C-BTS” hereinafter) 500 and a collaborative Access Terminal (referred to as “AT” hereinafter) 100 in a forward link system in which the AT 100 is distributed in a cluster composed of M BTSs. In the embodiment of the present invention, it is assumed that each C-BTS 500 uses nT transmission antennas, and all the ATs 100 use nR reception antennas.
An M value being the number of C-BTSs 500 capable of operating a collaboration method may instantaneously change due to a instantaneous channel variation between respective ATs 100 and C-BTSs 500. The foregoing embodiment considers a cluster composed of three C-BTSs 500 (M=3) for explanation. However, the present invention can extend to a cluster including an optional number of C-BTSs 500.
It is assumed that x is an MnT×1 data symbol vector simultaneously transmitted to a maximum of MnT ATs 100 through a total of MnT transmission antennas of M-BTSs 500, and y is a nR×1 received vector of the AT 100. Here, assuming a frequency non-selective fading, a received signal can be expressed by a following Equation (1).

:y=[√{square root over (γ1)}H1√{square root over (γ2)}H2√{square root over (γ3)}H3]Fx+n  (1)

where, γm is an average Signal-to-Noise Ratio (SNR) from an m-th C-BTS 500 to an AT 100, and Hm is an nR×nT complex matrix from the m-th C-BTS 500 to the AT 100. The Hnetwork is nR×MnT collaborative channel matrix from M C-BTSs 500 to the AT100, which is Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3], and the nk is an nR×1 Additive White Gaussian Noise (AWGN) vector. Further, F is an MnT×MnT transmission pre-coding for joint pre-coding of the x.
The AT 100 estimates down link channel {Hm}m=1, . . . , 3 from neighboring C-BTSs 500, and quantizes it to {{tilde over (H)}m}m=1, . . . , 3 by hybrid feedback technology according to the present invention and feedbacks the quantized {{tilde over (H)}m}m=1, . . . , 3 to respective C-BTSs 500. Moreover, the AT 100 estimates an inter-cell channel coefficient between cells compensating for a channel difference between the C-BTSs 500, quantizes it to {Xm}m=1, . . . , 3, and feedbacks the quantized {Xm}m=1, . . . , 3 to the respective C-BTSs 500.
The C-BTSs 500 connect with a MIMO network pre-coder (referred to as ‘pre-coder’ hereinafter) through high speed wideband wired communication network, and transfer the feedback quantized complete CSIs from the AT 100 to the pre-coder 600 through a wired communication network.
The pre-coder 600 calculates various MIMO technique combinations for the ATs 100 included in a corresponding cluster using feedback channel information {tilde over (H)}network=[χ1{tilde over (H)}1 χ2{tilde over (H)}2 χ3{tilde over (H)}3], and a received SINR of ATs 100 according to a pre-coding matrix by the combinations. Based on the calculation, the pre-coder 600 determines AT 100 set transmitting optimized data, a MIMO technology combination to be used by corresponding ATs 100, and a pre-coding matrix. The pre-coder 600 informs a scheduler of a corresponding C-BTS 500 of weight information to be used by ATs 100 transmitting data selected by scheduling and a corresponding AT 100, and Modulation and Coding Scheme (MCS) information of data to be transmitted, and a scheduler of each C-BTS 500 transmits data to a corresponding AT 100 by referring information provided from the pre-coder 500.
The AT 100 estimates an intra-cell down link channel Hm from the C-BTS 500, and feedbacks quantized complete CSI {tilde over (H)}m to respective C-BTS 500 using a limited amount of reverse link feedback information. There is a need for a large amount of instantaneous short-term reverse link feedback information to feedback an instantaneously changed intra-cell down link channel Hm itself to a transmitter. Such information is information related to a channel state. Hereinafter, channel state information transmitted from the AT 100 to the C-BTS 500 with a short-term period is referred to as “short-term channel information”.
Since a plurality of links divide a limited reverse link band width into a feedback channel and a data channel to be used, increase of short-term channel information transmitted every reverse link transmission frame is directly connected to reduction of a reverse link data channel capacity and a forward link data channel capacity according to reduction of a feedback channel capacity. Because reverse link feedback information transmitted with long-term for a long time through much reverse link transmission frames has small transmission feedback capacity by reverse link transmission frames, it influences reverse and forward data channel capacities a little. However, long-term channel information is not suitable to transmit instantaneously changed channel information. Hereinafter, channel state information transmitted from the AT 100 to the C-BTS 500 with a long-term period is referred to as ‘long-term channel information’.
Accordingly, down link channel information may be divided into long-term channel information not changed for a long time and short-term channel information instantaneously changed, and the long-term channel information and the short-term channel information are divided and transmitted through a long-term feedback channel transmitted for a long time through many frames and a short-term feedback channel transmitted every frame.
Hybrid feedback technology according to the present invention divides and expresses an intra-cell down link channel matrix Hm into an eigen matrix Em, a gain matrix Dm, and an output matrix Wm. In the embodiment of the present invention, the eigen matrix Em becomes long-term channel information, the gain matrix Dm and the output matrix Wm become short-term channel information. The divided matrixes can expressed by a following Equation (2).

:Hm=WmDmEmH  (2)

After divided as illustrated in the Equation (2), the eigen matrix Em, the gain matrix Dm, and the output matrix Wm are quantized, and the quantized eigen matrix Em is transmitted through a long-term feedback channel, and the quantized gain matrix Dm, and the quantized output matrix Wm are transmitted through a short-term feedback channel.
In the Equation (2), because an unitary matrix Em of the size nT×nT is an eigen matrix of E[HmHm], and obtained by accumulating and averaging covariance HmH Hm of an intra-cell down link channel matrix Hm for an enough long time, it does not change for a long time. Here, the enough long time may be one period of at least long-term feedback channel.
The gain matrix Dm is a diagonal matrix of the size nR×nT, and diagonal components are composed of R (R≦min(nR,nT)) values and min(nR,nT)-R zeros, with the size greater than or equal to a constant reference value Rth. Diagonal components constituting the gain matrix Dm indicate an instantaneous gain value received when beam forming is achieved by nT column vectors of an eigen matrix Em. Consequently, according to an instantaneous channel situation, the number R of gain values greater than or equal to a reference value and values instantaneously change. Specifically, when a transmission space correlation is high, the number R of gain values equal to a constant reference value Rth tends to become smaller, and respective gains tend to be increased.
The output matrix Wm of the size nR×nR is composed of vectors of the size nR×1 having R unit norm characteristics corresponding to R gain values of a Dm matrix and nR-R zero vectors of the size nR×1. R column vectors constituting the output matrix Wm mean receiving weight vectors to obtain R gain values. Accordingly, R column vectors instantaneously change according to an instantaneous channel situation.
For example, when nT is 4 and nR is 2, an intra-cell down link channel matrix Hm can be expressed by the following Equation (3) to be divided into an eigen matrix Em, a gain matrix Dm, and an output Wm.




  
    
      
        
          :
          
            H
            m
          
        
        =
        
          
            
              W
              m
            
            ⁢
            
              D
              m
            
            ⁢
            
              E
              m
              H
            
          
          =
          
            
              
                [
                
                  
                    w
                    
                      m
                      ,
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    w
                    
                      m
                      ,
                      2
                    
                  
                
                ]
              
              ⁡
              
                [
                
                  
                    
                      
                        d
                        
                          m
                          ,
                          1
                        
                      
                    
                    
                      0
                    
                    
                      0
                    
                    
                      0
                    
                  
                  
                    
                      0
                    
                    
                      
                        d
                        
                          m
                          ,
                          2
                        
                      
                    
                    
                      0
                    
                    
                      0
                    
                  
                
                ]
              
            
            ⁢
            
               
              
                [
                
                  
                    
                      
                        e
                        
                          m
                          ,
                          1
                        
                      
                    
                    
                      
                        e
                        
                          m
                          ,
                          2
                        
                      
                    
                    
                      
                        e
                        
                          m
                          ⁢
                          
                            
                          
                          ⁢
                          3
                        
                      
                    
                    
                      
                        
                          
                            e
                            
                              m
                              ⁢
                              
                                
                              
                              ⁢
                              4
                            
                          
                          ]
                        
                        H
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where, {em,n}n=1,2,3,4 are four column vectors constituting the eigen matrix Em, and a norm of {Wm,n}n=1,2 constituting Wm is 1. That is, ∥wm,1∥=∥wm,2∥=1. Further, it is assumed that all of diagonal components {dm,n}n=1,2 constituting the gain matrix Dm have the size equal to or greater than a constant reference value Rth.
Each AT 100 expresses an intra-cell down link channel matrix Hm by the Equation (2) to be divided into the eigen matrix Em, the gain matrix Dm, and the output matrix Wm, and quantizes the divided matrixes.
The AT 100 quantizes and transmits the eigen matrix Em through a long-term feedback channel. Furthermore, the AT 100 scalar-quantizes and transmits R diagonal components {dm,n}n=1, . . . , R of the gain matrix Dm through a short-term feedback channel. In addition, the AT 100 vector-quantizes and transmits R nR×1 column vectors constituting the output matrix Wm through a short-term feedback channel.
The gain matrix Dm and the output matrix Wm can be transmitted to be divided. However, without division of the gain matrix and the output matrix, after one matrix may be quantized, the quantized matrix can be transmitted through a short-term feedback channel. As a result, short-term channel information really required in hybrid feedback technology according to an embodiment of the present invention is information regarding R quantized scalar values and R quantized nR×1 vector values.
FIG. 2 is a diagram illustrating a schematic configuration of an apparatus for transmitting channel state information of a terminal according to an embodiment of the present invention.
Referring to FIG. 2, an AT 100 includes a transceiver 110, a channel estimator 120, a long-term channel information processor 130, a short-term channel information processor 140, and a channel coefficient processor 150. Here, a terminal uses a MIMO antenna and the nR MIMO antenna can be used to be indicated as reference numerals 21-1 to 21-nR in FIG. 2.
The transceiver 110 includes a demodulator, and receives and outputs pilot channels received from neighboring C-BTSs.
The channel estimator 120 estimates pilot channels received from neighboring C-BTSs to estimate down link channels {Hm}m=1, . . . , M from M C-BTSs 500 to a corresponding AT 100. Moreover, the channel estimator 120 estimates down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] from M C-BTSs 500 to a corresponding AT 100.
The long-term channel information processor 130 calculates and quantizes an eigen matrix Em of a corresponding down link channel Hm using down link channel information Hm from a m-th C-BTS 500 to an AT 100 estimated by the channel estimator 120. The long-term channel information processor 130 feedbacks the quantized eigen matrix {tilde over (E)}m to an m-th C-BTS as Long-Term Eigen Matrix (LTEM) feedback information LTEMm through a long-term feedback channel. The long-term channel information processor 130 performs such a procedure for M C-BTSs. Here, the eigen matrix Em of the size nT×nT can be calculated by averaging covariance HmHHm of Hm for an enough time to obtain a covariance matrix E[HmHHm], and performing Eigen Value Decomposition (EVD) for the covariance matrix E[HmHHm]. The larger a corresponding eigen value is, nT Column vectors, namely, eigen vectors constituting Em, are arranged at a left side. Accordingly, when Em=[em,1 em,2 . . . em,nT], a maximum eigen vector becomes em, 1.
The short-term channel information processor 140 multiplies Hermitain of an eigen matrix {tilde over (E)}m obtained by the long-term channel information processor 130 by the down link channel Hm as illustrated in a following Equation (4).

:Hm{tilde over (E)}mH=Fm=[fm,1fm,1 . . . fm,nT]  (4)

where, nR×nT matrixes Fm are composed of nT column vectors {fm,n}n=1, . . . , nT having the size nR×1. The short-term channel information processor 140 performs the foregoing procedure for M C-BTSs.
The short-term channel information processor 140 may quantize and feedback the obtained Fm to an m-th C-BTS 500 as short-term channel information through a short-term feedback channel.
As illustrated previously, Fm can be divided into two components including a gain matrix Dm and an output matrix Wm. The short-term channel information processor 140 may divide the Fm into a gain matrix Dm and an output matrix Wm, scalar and vector-quantize the gain matrix Dm and the output matrix Wm, and feedback the quantized gain matrix Dm and output matrix Wm to the m-th C-BTS as short-term channel information through a short-term feedback channel.
As illustrated earlier, the following is an operation of the short-term channel information processor 140 separately transmitting the matrixes. The short-term channel information processor 140 obtains a norm of nT column vectors of a matrix Fm, namely, {∥fm,n∥}n=1, . . . , nT, and compares {∥fm,n∥}n=1, . . . , R with a reference value Rth. The short-term channel information processor 140 scalar-quantizes R values {∥fm,n∥}n=1, . . . , R greater than the Rth. Subsequently, the short-term channel information processor 140 feedback indexes of R quantized scalar values to the m-th C-BTS 500 through a short-term feedback channel as R Short-term Gain Index (SGI) feedback information {SGIm,n}n=1, . . . , R. Here scalar quantization designs a scalar code book Fscalar composed of plural scalar values, and selects a scalar value minimizing a difference with {∥fm,n∥}n=1, . . . , R as illustrated in the following Equation (5).




  
    
      
        
          
            :
            
              
                d
                ~
              
              
                m
                ,
                n
              
            
          
          =
          
            
              
                argmin
                
                  d
                  ∈
                  
                    F
                    scalar
                  
                
              
              ⁡
              
                (
                
                  d
                  -
                  
                    
                    
                      f
                      
                        m
                        ,
                        n
                      
                    
                    
                  
                
                )
              
            
            2
          
        
        ,
        
          n
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        R
      
    
    
      
        (
        5
        )
      
    
  




The scalar code book Fscalar is preferably designed by non-uniform quantization in consideration of distribution of {∥fm,n∥}n=1, . . . , R according to the number of transmission/reception antennas and a channel environment. A quantized scalar value indicated by a feedback {SGIm,n}n=1, . . . , R is R diagonal components constituting a gain matrix Dm of the Equation (2). The short-term channel information processor 24 performs the scalar quantization for M C-BTSs 500.
The short-term information processor 140 normalizes R column vectors {∥fm,n∥}n=1, . . . , R of a matrix Fm as illustrated in a following Equation (6). Next, the short-term channel information processor 140 vector-quantizes and feedbacks R normalized vectors {∥{circumflex over (f)}m,n∥}n=1, . . . , R to the m-th C-BTS through a short-term feedback channel as R Output Vector Index (OVI) feedback {OVIm,n}n=1, . . . , R.




  
    
      
        
          
            :
            
              
                f
                ^
              
              
                m
                ,
                n
              
            
          
          =
          
            
              f
              
                m
                ,
                n
              
            
            
              
              
                f
                
                  m
                  ,
                  n
                
              
              
            
          
        
        ,
        
          n
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        R
      
    
    
      
        (
        6
        )
      
    
  




The quantized vector value indicated by a feedback {OVIm,n}n=1, . . . , R indicates R column vector constituting an output matrix Wm of the Equation (2). The short-term channel information processor 140 performs the vector quantization for M C-BTSs 500. The vector quantization designs a vector code book Fintra composed of vectors having the size nR×1, and selects a vector minimizing a distance D(w, {circumflex over (f)}m,n} from {∥{circumflex over (f)}m,n∥}n=1, . . . , R, namely, exactly imitating {∥{circumflex over (f)}m,n∥}n−1, . . . , R the most from the vector code book Fintra,




  
    
      
        
          
            :
            
              
                w
                ~
              
              
                m
                ,
                n
              
            
          
          =
          
            arg
            ⁢
            
              
                min
                
                  w
                  ∈
                  
                    F
                    intra
                  
                
              
              ⁢
              
                D
                ⁡
                
                  (
                  
                    w
                    ,
                    
                      
                        f
                        ^
                      
                      
                        m
                        ,
                        n
                      
                    
                  
                  )
                
              
            
          
        
        ,
        
          n
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        R
      
    
    
      
        (
        7
        )
      
    
  




Vectors of the size nR×1 constituting the vector code book Fintra should be designed to have isotropic distribution in an nR-dimensional complex vector space. Accordingly, the vectors of the size nR×1 may use a code book designed by a Random Vector Quantization (RVQ) scheme and a Grassmannian code book adapted to IEEE802.16e.
The channel coefficient processor 150 constructs a quantized intra-cell channel matrix {{tilde over (H)}m}m=1, . . . , M expressed by a following Equation (8). That is, the quantized intra-cell channel matrix {{tilde over (H)}m}m=1, . . . , M can be obtained by combining all values quantized by the long-term channel information processor 130 and the short-term channel information processor 140. The values are obtained by quantizing the eigen matrix Em, the gain matrix Dm, and the output matrix Wm that are structural components of a channel.
Subsequently, the channel coefficient processor 150 estimates an inter-cell channel coefficient compensating for a channel difference between C-BTSs 500 to exactly imitate the estimated down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] the most, and quantizes it to obtain and transmit {χm}m=1, . . . , 3 to a C-BTS 500 through the short-term feedback channel in an Inter-Cell Vector Index (ICVI) feedback way.

{tilde over (H)}m={tilde over (W)}m{tilde over (D)}m{tilde over (E)}mH=[{tilde over (w)}m,1 . . . {tilde over (w)}m,R0 . . . 0]diag{{tilde over (d)}m,1, . . . ,{tilde over (d)}m,R,0, . . . ,0}{tilde over (E)}mH  (8)

Namely, the channel coefficient processor 150 constructs a quantized intra-cell channel matrix {{tilde over (H)}m}m=1, . . . , M by combining the {tilde over (E)}m, the {tilde over (D)}m, and the {tilde over (W)}m previously obtained as illustrated in the Equation (8). Next, the channel coefficient processor 150 vector-quantizes a vector c=[X1 . . . XM]T composed of an inter-cell channel coefficient minimizing a distance between a MIMO network channel {tilde over (H)}network=[χ1{tilde over (H)}1 χ2{tilde over (H)}2 χ3{tilde over (H)}3] composed of a quantized intra-cell channel matrix {{tilde over (H)}m}m−1, . . . , M and a real down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] estimated by the channel estimator 120. The vector quantization designs an inter-cell channel vector code book Finter composed of vectors having the size M×1, and selects a vector minimizing a distance D({tilde over (H)}network, Hnetwork) between Hnetwork and {tilde over (H)}network as illustrated in a following Equation (9) from the designed inter-cell channel vector code book Finter.




  
    
      
        
          :
          c
        
        =
        
          arg
          ⁢
          
            
              min
              
                c
                ∈
                
                  F
                  inter
                
              
            
            ⁢
            
              D
              ⁡
              
                (
                
                  
                    
                      H
                      ~
                    
                    network
                  
                  ,
                  
                    H
                    network
                  
                
                )
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




Assuming that average SNR {γm}m=1, . . . , M from different C-BTSs 500 to one AT 100 in a cluster performing cooperation communication are similar thereto, vectors having the size M×1 constituting the inter-cell channel vector code book Finter should be designed to have isotropic distribution in an M-dimensional complex vector space. Accordingly, the vectors having the size M×1 may use a code book designed in an existing RVQ scheme or a Grassmannian adapted to IEEE802.16e.
FIG. 3 is a flowchart illustrating a method for transmitting channel state information of a terminal according to an embodiment of the present invention.
First, the AT 100 estimates a pilot channel received from neighboring C-BTSs 500 to estimate down link channels {Hm}m=1, . . . , M from M C-BTSs 500 to a corresponding AT 100, respectively in Step 310. Further, the AT 100 estimates a down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] from C-BTSs 500 to the AT 100. Subsequently, the AT 100 calculates an eigen matrix Em of a corresponding down link channel Hm using down link channel information Hm from an m-th C-BTS 500 to the AT 100 among the estimated channels, and quantizes the eigen matrix Em to obtain a quantized matrix {tilde over (E)}m in Step 320. Subsequently, the AT 100 feedbacks LTEM feedback information LTEMm to the m-th C-BTS 500 through the long-term feedback channel in Step 325. The AT 100 may perform Step 320 and Step 325 for M C-BTSs 500, respectively. Here, the eigen matrix Em of the size nT×nT is obtained by eigen value decomposing (EVD) a long-term covariance matrix E[HmHHm] obtained by averaging covariance HmHHm for an enough long time. the larger a corresponding eigen value is, nT column vectors, namely, eigen vectors constituting Em, are arranged at a left side. Accordingly, when Em=[em,1 em,2 . . . em,nT], a maximum eigen vector becomes em, 1.
Next, the AT 100 multiplies down link channel information Hm from an m-th C-BTS estimated in previous Step 310 to the AT 100 by Hermitain of an eigen matrix {tilde over (E)}m, estimated and quantized at Step 320 as illustrated in the Equation (4) to calculate and quantize a gain weight matrix Fm in Step 330. The nR×nT matrix Fm is composed of nT column vectors {fm,n}n=1, . . . , nT having the size nR×1.
As illustrated earlier, after quantizing the Fm, the AT 100 can feedback it to the m-th C-BTS through a short-term feedback channel as short-term channel information in Step 335. Further, the AT 100 may perform Steps 330 and 335 for M C-BTSs.
The AT 100 estimates and quantizes an inter-cell channel coefficient in Step 340. The AT 100 constructs an inter-cell channel matrix {{tilde over (H)}m}m=1, . . . , M expressed by the Equation (8), and estimates an inter-cell channel coefficient compensating a channel difference between C-BTSs 500 to exactly imitate the estimated down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] at Step 310 the most, and quantizes it to obtain {Xm}m=1, . . . , 3.
The quantized channel matrix {{tilde over (H)}m}m=1, . . . , M can be obtained by a combination of a quantized value of Em and a quantized value of Fm. The inter-cell channel coefficient {Xm}m=1, . . . , 3 is a value minimizing a distance between a MIMO network {tilde over (H)}network=[χ1{tilde over (H)}1 χ2{tilde over (H)}2 χ3{tilde over (H)}3] composed of the quantized channel matrix {{tilde over (H)}m}m=1, . . . , M and a real down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] estimated at Step 310. The AT 100 vector-quantizes vectors c=[X1 . . . XM]T composed of the inter-cell channel coefficient {Xm}m=1, . . . , 3.
The vector quantization is performed at Step 340 by designing the inter-cell channel vector code book Finter composed of vectors having the size M×1, and selecting a vector minimizing a distance D({tilde over (H)}network,Hnetwork) between Hnetwork and {tilde over (H)}network from the inter-cell channel vector code book Finter as illustrated in the Equation (9).
Assuming that averages SNR {γm}m=1, . . . , M from C-BTSs 500 performing cooperation communication to one AT 100 are similar to each other, vectors of the size M×1 constituting the inter-cell channel vector code book Finter should be designed to have isotropic distribution in an M-dimensional complex vector space. Accordingly, vectors of the size M×1 may use a code book designed in an existing RVQ scheme and a Grassmannian code book adapted to IEEE802.16e.
Subsequently, the AT 100 transmits values vector-quantized vectors c=[X1 . . . XM]T composed of inter-cell channel coefficient {Xm}m=1, . . . , 3 to a C-BTS 500 through a short-term feedback channel in an inter-cell vector index (ICVI) in Step 345.
FIG. 4 is a flowchart illustrating a method for transmitting channel state information of a terminal according to an embodiment of the present invention.
First, the AT 100 estimates a pilot channel received from neighboring C-BTSs 500 to estimate down link channels {Hm}m=1, . . . , M from M C-BTSs 500 to a corresponding AT 100 in Step 410. Further, the AT 100 estimates down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] from M C-BTSs 500 to a corresponding AT 100.
Subsequently, the AT 100 calculates an eigen matrix Em of a corresponding down link channel using down link channel information Hm from an m-th C-BTS 500 to the AT 100 among the estimated channels, and quantizes it to obtain a matrix {tilde over (E)}m in Step 420. Next, the AT 100 feedbacks LTEM feedback information LTEMm to the m-th C-BTS 500 through a long-term channel in Step 425.
The AT 100 may perform Steps 420 and 425 for M C-BTSs 500. Here, the eigen matrix Em of the size nT×nT is obtained by eigen value decomposing (EVD) a long-term covariance matrix E[HmHHm] obtained by averaging covariance HmHHm for an enough long time. the larger a corresponding eigen value is, nT column vectors, namely, eigen vectors constituting Em, are arranged at a left side. Accordingly, when Em=[em,1 em,2 . . . em,nT], a maximum eigen vector becomes em, 1.
Next, the AT 100 multiplies down link channel information Hm from an m-th C-BTS 500 to the AT 100 estimated at Step 410 by Hermitain of an eigen {tilde over (E)}m estimated and quantized at Step 420 to calculate and quantize a gain weight matrix Fm in Step 430.
An nR×nT matrix Fm is composed of nT column vectors {fm,n}n=1, . . . , nT of the size nR×1.
Subsequently, the AT 100 calculates and quantizes a gain matrix Dm from the gain weight matrix Fm in Step 440. That is, the AT 100 calculates a norm of nT column vectors of the gain weight matrix Fm obtained at Step 430, namely, {∥fm,n∥}n−1, . . . , nT. This means a gain matrix Dm. Further, the AT 100 compares {∥fm,n∥}n=1, . . . , nT with a reference value Rth. The AT 100 scalar-quantizes R values, namely, {∥fm,n∥}n=1, . . . , R greater than Rth.
Subsequently, the AT 100 transmits the quantized gain matrix to a short-term feedback channel in Step 445. That is, the AT 100 feedbacks an index of R quantized scalar values to an m-th C-BTSs 500 through a short-term feedback channel as R SGI feedback information {SGIm,n}n=1, . . . , R. The scalar quantization is performed at Step 440 by designing a scalar code book Fscalar composed of plural scalar values, and selecting a scalar value minimizing a distance between {∥fm,n∥}n=1, . . . , R as illustrated in the Equation (5) from the Fscalar.
The scalar code book Fscalar is designed by non-uniform quantization in consideration of distribution of {∥fm,n∥}n=1, . . . , R according to the number of transmission and reception antennas and a channel environment.
A quantized scalar value indicated by a feedback {SGIm,n}n=1, . . . , R is R diagonal components constituting a gain matrix Dm of the Equation (2). The AT 100 may perform Steps 440 and 445 for M C-BTSs 500.
Next, the AT 100 calculates and quantizes an output matrix Wm from a gain weight matrix Fm in Step 450. Namely, the AT 100 normalizes R column vectors {∥fm,n∥}n=1, . . . , R of the matrix Fm obtain at Step 430 as illustrated in the Equation (6) to calculate an output matrix Wm. Subsequently, that is, the AT 100 vector-quantizes R normalized vectors {∥{circumflex over (f)}m,n∥}n=1, . . . , R. Next, the AT 100 feedbacks R Output Vector Index (OVI) feedback information {OVIm,n}n=1, . . . , R to an m-th C-BTSs 500 through a short-term feedback channel in Step 455.
A quantized vector value indicated by a feedback {OVIm,n}n=1, . . . , R represents R column vectors constituting an output matrix Wm of the Equation (2). The AT 100 may perform Steps 450 and 455 for M C-BTSs 500. The vector quantization is performed at Step 450 by designing the vector code book Finter composed of vectors having the size nR×1, and selecting a vector {∥ƒ{circumflex over (f)}m,n∥}n=1, . . . , R minimizing a distance D(w, {circumflex over (f)}m,n} between {∥{circumflex over (f)}m,n∥}n=1, . . . , R, namely, exactly imitating {∥{circumflex over (f)}m,n∥}n=1, . . . , R from Finter as illustrated in the Equation (7).
Vectors of the size nR×1 constituting a vector code book Fintra should be designed to have isotropic distribution in an nR-dimensional complex vector space. Accordingly, the vectors of the size nR×1 may use a code book designed by an existing Random Vector Quantization (RVQ) scheme or a code book Grassmannian adapted to IEEE802.16e.
The AT 100 estimates and quantizes an inter-cell channel coefficient in Step 460. At Step 460, the AT 100 constructs a channel matrix {{tilde over (H)}m}m=1, . . . , M, and estimates an inter-cell channel coefficient compensating for a channel difference between C-BTSs 500 to exactly imitate the estimated down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] at Step 410 the most, and quantizes it to obtain {Xm}m=1, . . . , 3.
The quantized channel matrix {{tilde over (H)}m}m=1, . . . , M can be constructed by combining {tilde over (E)}m obtained at Step 430, {tilde over (D)}m obtained at Step 440, and {tilde over (W)}m obtained at Step 450 as illustrated in the Equation (8).
The inter-cell channel coefficient {Xm}m=1, . . . , 3 is a value minimizing a distance between a MIMO network channel {tilde over (H)}network=[χ1{tilde over (H)}1 χ2{tilde over (H)}2 χ3{tilde over (H)}3] composed of the quantized channel matrix {{tilde over (H)}m}m=1, . . . , M and a real down link MIMO network channel Hnetwork=[√{square root over (γ1)}H1 √{square root over (γ2)}H2 √{square root over (γ3)}H3] estimated at Step 410. The AT 100 vector-quantizes a vector c=[X1 . . . XM]T composed of the inter-cell channel coefficient {Xm}m=1, . . . , 3.
The vector quantization is performed at Step 460 by designing the inter-cell vector code book Finter composed of vectors having the size M×1, and selecting a vector minimizing a distance D({tilde over (H)}network,Hnetwork) between Hnetwork and {tilde over (H)}network from the inter-cell channel vector code book Finter as illustrated in the Equation (9).
Assuming that averages SNR {γm}m=1, . . . , M from C-BTSs 500 performing cooperation communication to one AT 100 are similar to each other, vectors of the size M×1 constituting the inter-cell channel vector code book Finter should be designed to have isotropic distribution in an M-dimensional complex vector space. Accordingly, vectors of the size M×1 may use a code book designed in an existing RVQ scheme and a Grassmannian code book adapted to IEEE802.16e.
Subsequently, the AT 100 transmits values vector-quantized vectors c=[X1 . . . XM]T composed of inter-cell channel coefficient {Xm}m=1, . . . , 3 to a C-BTS 500 through a short-term feedback channel in an Inter-Cell Vector Index (ICVI) in Step 465.
FIG. 5, FIG. 6A, and FIG. 6B are diagrams illustrating an apparatus for receiving transmitter channel state information according to an embodiment of the present invention.
Referring to FIG. 5, FIG. 6A, and FIG. 6B, a control channel information receiver of a MIMO network system of the present invention includes a plurality of C-BTSs 500 and a MIMO network pre-coder (referred to as ‘pre-coder’) 600.
The C-BTSs 500 include a plurality of antennas 41-1 to 41-nR, 42-1 to 42-nR for MIMO type transmission/reception. Each C-BTS 500 includes a feedback receiver 510 and a channel matrix restoring unit 520. Further, the feedback receiver 510 includes an output matrix restoring unit 511, a gain matrix restoring unit 513, and an eigen matrix restoring unit 515. In another embodiment of the present invention, a feedback receiver 510 includes a gain weight matrix restoring unit 517 instead of the output matrix restoring unit 511 and the gain matrix restoring unit 513.
The pre-coder 600 includes an inter-cell channel coefficient restoring unit 610, a network channel matrix restoring unit 620, and a scheduling and pre-coder determinator 630.
When the AT 100 transmits channel state information as illustrated in FIG. 4, the feedback receiver 510 includes an output matrix restoring unit 511, a gain matrix restoring unit 513, and an eigen matrix restoring unit 515 as shown in FIG. 6a, which is operated as follows. The feedback receiver 510 of each C-BTS 500 decodes received {OVIm,n}n=1, . . . , R, and restores an output matrix {tilde over (W)}m as illustrate in a following Equation (10) using vectors indicated in Fintra by R vector indexes. This is achieved by an output matrix restoring unit 511.

:{tilde over (W)}m=[{tilde over (w)}m,1 . . . {tilde over (w)}m,R0 . . . 0]  (10)

A feedback receiver 510 of each C-BTS 500 decodes received {SVIm,n}n=1, . . . , R, and restores a gain matrix {tilde over (D)}m of a diagonal matrix pattern as illustrated in a following Equation (11) using scalar values indicated in Fscalar by R indexes. This is achieved by the gain matrix restoring unit 513.

:{tilde over (D)}m=diag{{tilde over (d)}m,1, . . . ,{tilde over (d)}m,R,0, . . . ,0}  (11)

A feedback receiver 510 of each C-BTS 500 decodes a received LTEMm, and restores an eigen matrix {tilde over (E)}m. This is achieved by an eigen matrix restoring unit 515.
When the AT 100 transmits channel state information as illustrate in FIG. 3, the feedback receiver 510 includes a gain weight matrix restoring unit 517 and an eigen matrix restoring unit 515 as illustrated in FIG. 6B, which is operated as follows.
A feedback receiver 510 of each C-BTS 500 restores a matrix {tilde over (F)}m achieved by quantizing a received Fm. This is achieved by a gain weight matrix restoring unit 517.
Moreover, a feedback receiver 510 of each C-BTS 500 decodes a received LTEMm to restore an eigen matrix {tilde over (E)}m. This is achieved by an eigen matrix restoring unit 515. An inter-cell channel matrix restoring unit 520 of each C-BTS 500 combines {tilde over (W)}m, {tilde over (D)}m, and {tilde over (E)}m restored by the feedback receiver 510 or restored {tilde over (E)}m and {tilde over (F)}m restored by the feedback receiver 510. Subsequently, a channel matrix restoring unit 520 of each C-BTS 500 restores a quantized inter-cell channel matrix as illustrated in a following Equation (12).

:{tilde over (H)}m={tilde over (W)}m{tilde over (D)}m{tilde over (E)}mH 

{tilde over (H)}={tilde over (F)}m{tilde over (E)}mH  (12)

An inter-cell channel coefficient restoring unit 610 decodes a received ICVI, and restores {Xm}m=1, . . . , M being an inter-cell channel coefficient by referring a vector indicated in a vector code book Finter by an index.
The network channel matrix restoring unit 620 constructs quantized channel matrixes {{tilde over (H)}m}m−1, . . . , M and a restored inter-cell channel coefficient {Xm}m=1, . . . , M as illustrated in a following Equation (13) to restore a MIMO network channel.

:{tilde over (H)}network=[χ1{tilde over (H)}1 . . . χM{tilde over (H)}M]  (13)

Here, quantized channel matrixes {{tilde over (H)}m}m=1, . . . , M are restored by C-BTSs 500 and transferred to a network channel matrix restoring unit 620 through backhaul. Further, the network channel matrix restoring unit 620 receives a restored inter-cell channel coefficient {Xm}m=1, . . . , M from the inter-cell channel coefficient restoring unit 610.
The scheduling and pre-coder determinator 630 schedules using restored MIMO network channel information according to each AT 500. Further, the scheduling and pre-coder determinator 630 determines a pre-coding matrix according to scheduling, and calculates and determines a transmission possible capacity.
FIG. 7 is a flowchart illustrating a method for receiving channel state information of a network according to an embodiment of the present invention.
Referring to FIG. 7, a feedback receiver of each C-BTS 500 restores a matrix {tilde over (F)}m obtained by quantizing a received Fm in Step 710. This is achieved by a gain weight matrix restoring unit 517.
Next, a feedback receiver 510 of each C-BTS 500 decodes a received LTEMm to restored an eigen matrix {tilde over (E)}m in Step 720. This is achieved by an eigen matrix restoring unit 515.
Subsequently, a channel matrix restoring unit 520 of each C-BTS 500 combines {tilde over (E)}m  {tilde over (F)}m restored by the feedback receiver 510 to restore a quantized channel matrix as illustrated in the Equation (12) in Step 730.
After decoding a received ICVI, an inter-cell channel coefficient restoring unit 610 restores an inter-cell channel coefficient {Xm}m=1, . . . , M by referring a vector in a vector code book Finter indicated by the index in Step 740.
A network channel matrix restoring unit 620 restores a MIMO network channel in Step 750. The MIMO network channel may be restored by a combination of quantized channel matrixes {{tilde over (H)}m}m=1, . . . , M and a restored inter-cell channel coefficient {Xm}m=1, . . . , M illustrated in the Equation (13).
The quantized channel matrixes {{tilde over (H)}m}m=1, . . . , M are restored by C-BTSs 500, and the network channel matrix restoring unit 620 receives them by backhaul. The network channel matrix restoring unit 620 receives the inter-cell channel coefficient {Xm}m=1, . . . , M from the inter-cell channel coefficient restoring unit 610.
A scheduling and pre-coder determinator 630 schedules using MIMO network channel information restored by ATs 100 in Step 760. Next, the scheduling and pre-coder determinator 630 determines a pre-coding matrix according to the scheduling, and calculates and determines a transmission possible capacity in Step 770.
FIG. 8 is a flowchart illustrating a method for receiving channel state information of a network according to an embodiment of the present invention.
Referring to FIG. 8, after decoding a received {OVIM,n}n=1, . . . , R, a feedback receiver 510 of each C-BTS restores an output matrix {tilde over (W)}m using vectors in Fintra indicated by R vector indexes as illustrated in the Equation (10) in Step 810. This is achieved by an output matrix restoring unit 511.
A feedback receiver 510 of each C-BTS 500 decodes a received {SVIm,n}n=1, . . . , R, and restores a gain matrix of a diagonal matrix pattern {tilde over (D)}m using scalar values in Fscala indicated by R indexes as illustrated in the Equation (11) in Step 820. This is achieved by a gain matrix restoring unit 513.
A feedback receiver 510 decodes a received LTEMm by C-BTSs 500 to restore an eigen matrix {tilde over (E)}m in Step 830. This is achieved by an eigen matrix restoring unit 515.
A channel matrix restoring unit 520 of each C-BTS 500 combines {tilde over (W)}m, {tilde over (D)}m, and {tilde over (E)}m restored by the feedback receiver 510 to restore a quantized channel matrix as illustrated in the Equation (12) in Step 840.
The inter-cell channel coefficient restoring unit 610 decodes a received ICVI, and restores an inter-cell channel coefficient {Xm}m=1, . . . , M by referring a vector in a vector code book Finter indicated by an index in Step 850.
A network channel matrix restoring unit 620 constructs quantized channel matrixes {{tilde over (H)}m}m=1, . . . , M and a restored inter-cell channel coefficient {Xm}m=1, . . . , M as illustrated in the Equation (13) to restore a MIMO network channel in Step 860.
The quantized channel matrixes {{tilde over (H)}m}m=1, . . . , M are restored by C-BTSs 500, and a network channel matrix restoring unit 620 receives them through backhaul. The network channel matrix restoring unit 620 receives the inter-cell channel coefficient {Xm}m=1, . . . , M from the inter-cell channel coefficient restoring unit 610.
A scheduling and pre-coder determinator 630 schedules using MIMO network channel information restored by ATs 100 in Step 870. Next, the scheduling and pre-coder determinator 630 determines a pre-coding matrix according to scheduling, and calculates and determines a transmission possible capacity in Step 880.
The present invention provides hybrid feedback technology for efficiently combining limited amounts of long-term feedback information and short-term feedback information to transmit complete CSI to a transmitter in a MIMO network antenna system. To analyze the performance of the provided hybrid feedback technology, the performance a direct quantization based feedback scheme transferring complete CSI and the performance of a Singular Value Decomposition (SVD) quantization based feedback scheme are compared and analyzed based on a capacity of a Spatial Multiplexing (SM) system. It is assume that the number nT of transmission antennas in a considered SM system is four, an antenna interval is 0.5λ, the number nR of reception antennas is two, and there is no space correlation between reception antennas. The following is an SM system using hybrid feedback technology implemented on simulation. The AT 100 estimates an inter-cell down link channel Hm from a BTS 500, and feedbacks quantized feedbacks complete CSI {tilde over (H)}m to a BTS using the provided hybrid feedback technology. It is assume that long-term feedback information Em is transferred to a BTS without a quantization error or a transmission error. R diagonal components {dm,n}n=1, . . . , r of a gain matrix Dm are quantized to 5 bits, and r 2×1 column vectors of an output matrix Wm are vector-quantized using a 3 bit 2×1 vector coder book of IEEE 802.16e.
A transmitter SVDs feedback complete CSI {tilde over (H)}m to calculate a right singular matrix {tilde over (V)}m and a diagonal matrix {tilde over (Λ)}m composed of diagonal components or singular values. An optimal power allocation matrix {tilde over (P)}m is determined by a water-filling algorithm based on an average received SNR ρ and obtained singular values, and pre-codes a real channel matrix Hm using pre-coding matrix {tilde over (F)}m={tilde over (V)}m{tilde over (P)}m to transmit data. At this time, a channel capacity of a pre-coded channel matrix Hm{tilde over (F)}m is expressed by a following Equation (14).

:C(Hm{tilde over (F)}m,ρ)=log2det(InR+ρHm{tilde over (F)}m{tilde over (F)}mHHmH)  (14)

An operation of an SM system using direct quantization based feedback technology and SVD quantization based feedback technology is the same as that of an SM system using hybrid feedback technology. However, there is a difference in quantization and feedback technologies used upon feedback quantized complete CSI {tilde over (H)}m to a base station. The direct quantization based feedback technology quantizes a norm of nT nR×1 column vectors, namely, {∥hm,n∥}n=1, . . . nT constituting an inter-cell down link channel matrix Hm to 5 bits, and nT quantized nR×1 column vectors {hm,n/}∥hm,n∥}n=1, . . . , nT are vector-quantized using 3 bit 2×1 code book of IEEE 802.16e. The SVD quantization based feedback technology SVDs an inter-cell down link channel matrix Hm to Hm=UmLmVmH to, and quantizes Um and Vm using a 3 bit 2×2 unitary matrix code book and a 3 bit 4×4 unitary matrix code book of IEEE 802.16e. Further, the SVD quantization based feedback technology quantizes min(nR,nT) singular values constituting Λm to 5 bits.
FIG. 9 is a graph comparing transmission capacities of an SM system according to complete CSI feedback technology.
A graph of FIG. 9 is channel CSI feedback technology, which indicates an ideal method transmitting a channel matrix of a non-quantized complete down link channel, a direct quantization directly quantizing and transmitting a channel matrix, an SVD quantization SVD quantizing a channel matrix, and a hybrid FB according to an embodiment of the present invention.
The ideal method indicates an upper bound capacity as a transmission capacity of an SM achievable using non-quantized complete down link channel information Hm. The direct quantization uses an instantaneous feedback information amount of 32 bits/frame, the SVD quantization uses an instantaneous feedback information amount of 16 bits/frame, and the provided hybrid feedback technology uses an instantaneous feedback information amount less than 16 bits/frame.
As illustrated, the provided hybrid feedback technology provides a maximum SM capacity using the lowest feedback information amount in various space correlation environment. Specifically, the provided hybrid feedback technology provides a capacity of upper bound in an Angular Spread at Transmitter (AST) range of a general mobile communication environment, namely, AST≦15°. It can be appreciated that hybrid feedback technology provided through this transmits complete CSI to a transmitter using minimum short-term feedback information in a general mobile communication environment.
As illustrated previously, the present invention provides hybrid feedback technology that efficiently combines limited amounts of long-term feedback information and short-term feedback information to transmit complete CSI to a MIMO network transmitter.
The hybrid feedback technology provided by the present invention divides and quantizes a down link MIMO channel matrix into a long-term eigen matrix which does not instantaneously change, a short-term gain matrix which instantaneously changes, and an output matrix to transfer complete CSI to a transmitter using minimum short-term feedback information.
As described earlier, layered feedback technology for a MIMO network system according to the present invention may feedback complete CSI regarding an inter-cell down link channel matrix feedback by C-BTSs 500 and inter-cell channel coefficient information compensating a channel difference between C-BTSs 500 to simultaneously use singular cell MIMO technology and MIMO network technology.
As illustrated previously, feedback technology of complete CSI for a down link MIMO network channel matrix according to the present invention enables a pre-coder 600 to calculate various MIMO technology combinations and a receiving possible SINR of ATs 100 with respect to a pre-coding matrix, and simultaneously optimize ATs 100 transmitting data and MIMO technology combination and pre-coding matrix to be used by corresponding ATs 100 based on it.
Although embodiments of the present invention have been described in detail hereinabove, it should be clearly understood that many variations and modifications of the basic inventive concepts herein taught which may appear to those skilled in the present art will still fall within the spirit and scope of the present invention, as defined in the appended claims.

## Claims

1. A method for transmitting channel state information (CSI) by a terminal in a communication system supporting connection between the terminal and a plurality of base stations, the method comprising:
receiving a signal from a first serving base station;
receiving a signal from a second serving base station;
measuring a channel based on the signal received from the first serving base station;
measuring a channel based on the signal received from the second serving base station;
computing a CSI for the first serving base station;
computing a CSI for the second serving base station;
transmitting the computed CSI for the first serving base station on a channel for the first serving base station; and
transmitting the computed CSI for the second serving base station on a channel for the second serving base station.

2. The method of claim 1, wherein each of the computed CSI for the first serving base station and the computed CSI for the second serving base station comprises a first type information and a second type information.

3. The method of claim 2, wherein the first type information is long-term information and the second type information is short-term information.

4. The method of claim 2, wherein the first type information includes an eigen matrix obtained by accumulating covariance of a channel matrix indicating the measured channel and the second type information includes a value obtained by multiplying the channel matrix by Hermitain of the eigen matrix.

5. The method of claim 2, wherein the first type information does not instantaneously change in every frame and the second type information instantaneously changes in every frame.

6. A method for receiving channel state information (CSI) by a first serving base station in a communication system supporting connection between a terminal and a plurality of base stations, the method comprising:
transmitting a signal to the terminal; and
receiving a CSI for the first serving base station based on the signal, from the terminal, on a channel for the first serving base station,
wherein the CSI for the first serving base station is computed, by the terminal, based on the signal transmitted from the first serving base station connected to the terminal, and
wherein a CSI for a second serving base station is computed, by the terminal, based on a signal transmitted from the second serving base station connected to the terminal, and the CSI for the second serving base station is transmitted on a channel for the second serving base station.

7. The method of claim 6, wherein each of the CSI for the first serving base station and the CSI for the second serving base station comprises a first type information and a second type information.

8. The method of claim 7, wherein the first type information is long-term information and the second type information is short-term information.

9. The method of claim 7, wherein the first type information includes an eigen matrix obtained by accumulating covariance of a channel matrix indicating the measured channel and the second type information includes a value obtained by multiplying the channel matrix by Hermitain of the eigen matrix.

10. The apparatus of claim 7, wherein the first type information does not instantaneously change in every frame and the second type information instantaneously changes in every frame.

11. A terminal for transmitting channel state information (CSI) in a communication system supporting connection between the terminal and a plurality of base stations, the terminal comprising:
a transceiver configured to transmit and receive signals to and from a first serving base station and a second serving base station; and
a controller configured to:
receive a signal from the first serving base station,
receive a signal from the second serving base station,
measure a channel based on the signal received from the first serving base station,
measure a channel based on the signal received from the serving second base station,
compute a CSI for the first serving base station,
compute a CSI for the second serving base station,
transmit the computed CSI for the first serving base station on a channel for the first serving base station, and
transmit the computed CSI for the second serving base station on a channel for the second serving base station.

12. The apparatus of claim 11, wherein each of the computed CSI for the first base station and the computed CSI for the second base station comprises a first type information and a second type information.

13. The terminal of claim 12, wherein the first type information is long-term information and the second type information is short-term information.

14. The terminal of claim 12, wherein the first type information includes an eigen matrix obtained by accumulating covariance of a channel matrix indicating the measured channel and second type information includes a value obtained by multiplying the channel matrix by Hermitain of the eigen matrix.

15. The terminal of claim 12, wherein the first type information does not instantaneously change in every frame and the second type information instantaneously changes in every frame.

16. A first serving base station for receiving channel state information (CSI) in a communication system supporting connection between a terminal and a plurality of base stations, the first serving base station comprising:
a transceiver configured to transmit and receive signals to and from the terminal; and
a controller configured to:
transmit a signal, and
receive a CSI for the first serving base station based on the signal, from the terminal, on a channel for the first serving base station,

wherein the CSI for the first serving base station is computed, by the terminal, based on the signal transmitted from the first serving base station connected to the terminal, and
wherein a CSI for a second serving base station is computed, by the terminal, based on a signal transmitted from the second serving base station connected to the terminal, and the CSI for the second serving base station is transmitted on a channel for the second serving base station.

17. The base station of claim 16, wherein each of the CSI for the first serving base station and the CSI for the second serving base station comprises a first type information and a second type information.

18. The base station of claim 17, wherein the first type information is long-term information and the second type information is short-term information.

19. The base station of claim 17, wherein the first type information includes an eigen matrix obtained by accumulating covariance of a channel matrix indicating the measured channel and second type information includes a value obtained by multiplying the channel matrix by Hermitain of the eigen matrix.

20. The base station of claim 17, wherein the first type information does not instantaneously change in every frame and the second type information instantaneously changes in every frame.