# Patent

## Title
Method and system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback

## Abstract

A MIMO pre-coding system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback may include quantizing a change in channel state information in a MIMO pre-coding system onto a codebook, which comprises one or more unitary matrices, using a cost function. The codebook may be generated based on at least the channel state information. The channel state information may comprise a matrix V and the cost function f(A) may be defined by the following relationship:




  
    f
    ⁡
    
      (
      A
      )
    
  
  =
  
    (
    
      
        1
        N
      
      ⁢
      
        
          ∑
          
            j
            =
            1
          
          N
        
        ⁢
        
          
            
            
              a
              jj
            
            
          
          2
        
      
    
    )
  




where A is a matrix of size N by N and aij is element (i,j) of matrix A. One or more unitary matrices may be generated from at least a first set of matrices and a second set of matrices, where the first set of matrices may comprise one or more Givens matrices. A dynamic range and a resolution of the codebook may be modified.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS/INCORPORATION BY REFERENCE
This application is a continuation of U.S. application Ser. No. 11/767,123 filed on Jun. 22, 2007. The above stated application is incorporated herein by reference in their entirety.
This application makes reference to, claims priority to, and claims the benefit of U.S. Provisional Application Ser. No. 60/884,133, filed on Jan. 9, 2007.
This application makes reference to:

    U.S. Application Ser. No. 60/884,118, filed on Jan. 9, 2007;
    U.S. Application Ser. No. 60/884,113, filed on Jan. 9, 2007;
    U.S. Application Ser. No. 60/884,132, filed on Jan. 9, 2007;
    U.S. application Ser. No. 11/767,071, filed on even date herewith;
    U.S. application Ser. No. 11/767,108, filed on even date herewith; and
    U.S. application Ser. No. 11/767,158, filed on even date herewith;


Each of the above referenced applications is hereby incorporated herein by reference in its entirety.


FIELD OF THE INVENTION
Certain embodiments of the invention relate to signal processing for communication systems. More specifically, certain embodiments of the invention relate to a method and system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback.
BACKGROUND OF THE INVENTION
Mobile communications have changed the way people communicate and mobile phones have been transformed from a luxury item to an essential part of every day life. The use of mobile phones is today dictated by social situations, rather than hampered by location or technology. While voice connections fulfill the basic need to communicate, and mobile voice connections continue to filter even further into the fabric of every day life, the mobile Internet is the next step in the mobile communication revolution. The mobile Internet is poised to become a common source of everyday information, and easy, versatile mobile access to this data will be taken for granted.
Third generation (3G) cellular networks have been specifically designed to fulfill these future demands of the mobile Internet. As these services grow in popularity and usage, factors such as cost efficient optimization of network capacity and quality of service (QoS) will become even more essential to cellular operators than it is today. These factors may be achieved with careful network planning and operation, improvements in transmission methods, and advances in receiver techniques. To this end, carriers need technologies that will allow them to increase downlink throughput and, in turn, offer advanced QoS capabilities and speeds that rival those delivered by cable modem and/or DSL service providers.
In order to meet these demands, communication systems using multiple antennas at both the transmitter and the receiver have recently received increased attention due to their promise of providing significant capacity increase in a wireless fading environment. These multi-antenna configurations, also known as smart antenna techniques, may be utilized to mitigate the negative effects of multipath and/or signal interference on signal reception. It is anticipated that smart antenna techniques may be increasingly utilized both in connection with the deployment of base station infrastructure and mobile subscriber units in cellular systems to address the increasing capacity demands being placed on those systems. These demands arise, in part, from a shift underway from current voice-based services to next-generation wireless multimedia services that provide voice, video, and data communication.
The utilization of multiple transmit and/or receive antennas is designed to introduce a diversity gain and to raise the degrees of freedom to suppress interference generated within the signal reception process. Diversity gains improve system performance by increasing received signal-to-noise ratio and stabilizing the transmission link. On the other hand, more degrees of freedom allow multiple simultaneous transmissions by providing more robustness against signal interference, and/or by permitting greater frequency reuse for higher capacity. In communication systems that incorporate multi-antenna receivers, a set of M receive antennas may be utilized to null the effect of (M-1) interferers, for example. Accordingly, N signals may be simultaneously transmitted in the same bandwidth using N transmit antennas, with the transmitted signal then being separated into N respective signals by way of a set of N antennas deployed at the receiver. Systems that utilize multiple transmit and receive antennas may be referred to as multiple-input multiple-output (MIMO) systems. One attractive aspect of multi-antenna systems, in particular MIMO systems, is the significant increase in system capacity that may be achieved by utilizing these transmission configurations. For a fixed overall transmitted power and bandwidth, the capacity offered by a MIMO configuration may scale with the increased signal-to-noise ratio (SNR). For example, in the case of fading multipath channels, a MIMO configuration may increase system capacity by nearly M additional bits/cycle for each 3-dB increase in SNR.
The widespread deployment of multi-antenna systems in wireless communications has been limited by the increased cost that results from increased size, complexity, and power consumption. This poses problems for wireless system designs and applications. As a result, some work on multiple antenna systems may be focused on systems that support single user point-to-point links, other work may focus on multiuser scenarios. Communication systems that employ multiple antennas may greatly improve the system capacity.
To obtain significant performance gains using MIMO technology, it may however be desirable to supply information on the channel to the transmitter to allow, for example, MIMO pre-coding. MIMO pre-coding and other MIMO technologies based at the MIMO transmitter may benefit or require knowledge about the channel, referred to as channel state information (CSI). Furthermore, because many wireless systems operate in frequency division duplex (FDD) mode, the uplink and downlink connections may use different frequencies. In these instances, channel measurements may only be made available at the transmitter by measuring the channel at the receiver and feeding back the information. However, with increasing numbers of transmit and receive antennas in the MIMO system, feeding back channel state information may involve transferring large amounts of data.
Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.
BRIEF SUMMARY OF THE INVENTION
A method and/or system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims.
These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.



BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS
FIG. 1A is a diagram illustrating exemplary cellular multipath communication between a base station and a mobile computing terminal, in connection with an embodiment of the invention.
FIG. 1B is a diagram illustrating an exemplary MIMO communication system, in accordance with an embodiment of the invention.
FIG. 2 is a block diagram illustrating an exemplary MIMO pre-coding transceiver chain model, in accordance with an embodiment of the invention.
FIG. 3 is a block diagram of an exemplary MIMO pre-coding system with finite rate channel state information feedback, in accordance with an embodiment of the invention.
FIG. 4 is a flow chart illustrating an exemplary implementation of a codebook algorithm, in accordance with an embodiment of the invention.
FIG. 5 is a performance line plot of an exemplary 2×2 MIMO system with a 4-element codebook, in accordance with an embodiment of the invention.



DETAILED DESCRIPTION OF THE INVENTION
Certain embodiments of the invention may be found in a method and system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback. Aspects of the method and system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback may comprise quantizing a change in channel state information in a MIMO pre-coding system onto a codebook, which comprises one or more unitary matrices, using a cost function; and generating the codebook based on at least the channel state information. The channel state information may comprise a matrix V and the cost function f(A) may be defined by the following relationship:




  
    f
    ⁡
    
      (
      A
      )
    
  
  =
  
    (
    
      
        1
        N
      
      ⁢
      
        
          ∑
          
            j
            =
            1
          
          N
        
        ⁢
        
          
            
            
              a
              jj
            
            
          
          2
        
      
    
    )
  




where A is a matrix of size N by N and aij is an element (i,j) of the matrix A. One or more unitary matrices may be generated from at least a first set of matrices and a second set of matrices, where the first set of matrices may comprise one or more Givens matrices. A dynamic range and a resolution of the codebook may be modified by modifying a step size variable and a cardinality of the codebook, respectively. The cardinality of the codebook may be modified by modifying a set of angular levels. The MIMO pre-coding system may comprise transmitting an index of an element of the codebook, onto which the change in channel state information is quantized, from a receiver to a transmitter. A communication system comprising the MIMO pre-coding system may comprise one or more transmit antennas and one or more receive antennas. The matrix V may be generated via decomposition, for example, using a Singular Value Decomposition (SVD) or a Geometric Mean Decomposition (GMD). At the transmitter of the MIMO pre-coding system, a matrix may be linearly transformed with one of the unitary matrices.

FIG. 1A is a diagram illustrating exemplary cellular multipath communication between a base station and a mobile computing terminal, in connection with an embodiment of the invention. Referring to FIG. 1A, there is shown a house 120, a mobile terminal 122, a factory 124, a base station 126, a car 128, and communication paths 130, 132 and 134.
The base station 126 and the mobile terminal 122 may comprise suitable logic, circuitry and/or code that may be enabled to generate and process MIMO communication signals. Wireless communications between the base station 126 and the mobile terminal 122 may take place over a wireless channel. The wireless channel may comprise a plurality of communication paths, for example, the communication paths 130, 132 and 134. The wireless channel may change dynamically as the mobile terminal 122 and/or the car 128 moves. In some cases, the mobile terminal 122 may be in line-of-sight (LOS) of the base station 126. In other instances, there may not be a direct line-of-sight between the mobile terminal 122 and the base station 126 and the radio signals may travel as reflected communication paths between the communicating entities, as illustrated by the exemplary communication paths 130, 132 and 134. The radio signals may be reflected by man-made structures like the house 120, the factory 124 or the car 128, or by natural obstacles like hills. Such a system may be referred to as a non-line-of-sight (NLOS) communications system.
A communication system may comprise both LOS and NLOS signal components. If a LOS signal component is present, it may be much stronger than NLOS signal components. In some communication systems, the NLOS signal components may create interference and reduce the receiver performance. This may be referred to as multipath interference. The communication paths 130, 132 and 134, for example, may arrive with different delays at the mobile terminal 122. The communication paths 130, 132 and 134 may also be differently attenuated. In the downlink, for example, the received signal at the mobile terminal 122 may be the sum of differently attenuated communication paths 130, 132 and/or 134 that may not be synchronized and that may dynamically change. Such a channel may be referred to as a fading multipath channel. A fading multipath channel may introduce interference but it may also introduce diversity and degrees of freedom into the wireless channel. Communication systems with multiple antennas at the base station and/or at the mobile terminal, for example MIMO systems, may be particularly suited to exploit the characteristics of wireless channels and may extract large performance gains from a fading multipath channel that may result in significantly increased performance with respect to a communication system with a single antenna at the base station 126 and at the mobile terminal 122, in particular for NLOS communication systems.
FIG. 1B is a diagram illustrating an exemplary MIMO communication system, in accordance with an embodiment of the invention. Referring to FIG. 1B, there is shown a MIMO transmitter 102 and a MIMO receiver 104, and antennas 106, 108, 110, 112, 114 and 116. There is also shown a wireless channel comprising communication paths h11, h12, h22, h21, h2 NTX, h1 NTX, hNRX 1, hNRX 2, hNRX NTX, where hmn may represent a channel coefficient from transmit antenna n to receiver antenna m. There may be NTX transmitter antennas and NRX receiver antennas. There is also shown transmit symbols x1, x2 and XNTX, and receive symbols y1, y2 and yNRX.
The MIMO transmitter 102 may comprise suitable logic, circuitry and/or code that may be enabled to generate transmit symbols xi iε{1, 2, . . . NTX} that may be transmitted by the transmit antennas, of which the antennas 106, 108 and 110 may be depicted in FIG. 1B. The MIMO receiver 104 may comprise suitable logic, circuitry and/or code that may be enabled to process the receive symbols yi iε{1, 2, . . . NRX} that may be received by the receive antennas, of which the antennas 112, 114 and 116 may be shown in FIG. 1B. An input-output relationship between the transmitted and the received signal in a MIMO system may be written as:

y=Hx+n 

where y=[y1, y2, . . . yNRX]T may be a column vector with NRX elements, .T may denote a vector transpose, H=[hij]: iε{1, 2, . . . NRX}; jε{1, 2, . . . NTX} may be a channel matrix of dimensions NRX by NTX, x=[x1,x2, . . . xNTX]T is a column vector with NTX elements and n is a column vector of noise samples with NRX elements. The channel matrix H may be written, for example, as H=UΣVH using the Singular Value Decomposition (SVD), where .H denotes the Hermitian transpose, U is a NRX by NTX unitary matrix, Σ is a NTX by NTX diagonal matrix and V is NTX by NTX unitary matrix. Other matrix decompositions that may diagonalize or transform the matrix H may be used instead of the SVD. If the receiver algorithm implemented in MIMO receiver 104 is, for example, an Ordered Successive Interference Cancellation (OSIC), other matrix decompositions that convert the matrix H to lower/upper triangular may be appropriate. One such decomposition may comprise Geometric Mean Decomposition (GMD), where H=QRPH, where R may be upper triangular with the geometric mean of the singular values of H on the diagonal elements, and Q and P may be unitary.

FIG. 2 is a block diagram illustrating an exemplary MIMO pre-coding transceiver chain model, in accordance with an embodiment of the invention. Referring to FIG. 2, there is shown a MIMO pre-coding system 200 comprising a MIMO transmitter 202, a MIMO baseband equivalent channel 203, a MIMO receiver 204, and an adder 208. The MIMO transmitter 202 may comprise a transmitter (TX) baseband processing block 210 and a transmit pre-coding block 214. The MIMO baseband equivalent channel 203 may comprise a wireless channel 206, a TX radio frequency (RF) processing block 212 and a receiver (RX) RF processing block 218. The MIMO receiver 204 may comprise a pre-coding decoding block 216 and a RX baseband processing block 220. There is also shown symbol vector s, pre-coded vector x, noise vector n, received vector y and channel-decoded vector y′.
The MIMO transmitter 202 may comprise a baseband processing block 210, which may comprise suitable logic, circuitry and/or code that may be enabled to generate a MIMO baseband transmit signal. The MIMO baseband transmit signal may be communicated to a transmit pre-coding block 214. A baseband signal may be suitably coded for transmission over a wireless channel 206 in the transmit pre-coding block 214 that may comprise suitable logic, circuitry and/or code that may enable it to perform these functions. The TX RF processing block 212 may comprise suitable logic, circuitry and/or code that may enable a signal communicated to the TX RF processing block 212 to be modulated to radio frequency (RF) for transmission over the wireless channel 206. The RX RF processing block 218 may comprise suitable logic, circuitry and/or code that may be enabled to perform radio frequency front-end functionality to receive the signal transmitted over the wireless channel 206. The RX RF processing block 218 may comprise suitable logic, circuitry and/or code that may enable the demodulation of its input signals to baseband. The adder 208 may depict the addition of noise to the received signal at the MIMO receiver 204. The MIMO receiver 204 may comprise the pre-coding decoding block 216 that may linearly decode a received signal and communicate it to the RX baseband processing block 220. The RX baseband processing block 220 may comprise suitable logic, circuitry and/or logic that may enable to apply further signal processing to baseband signal.
The MIMO transmitter 202 may comprise a baseband processing block 210, which may comprise suitable logic, circuitry and/or code that may be enabled to generate a MIMO baseband transmit signal. The MIMO baseband transmit signal may be communicated to a transmit pre-coding block 214 and may be the symbol vector s. The symbol vector s may be of dimension NTX by 1.
The transmit pre-coding block 214 may be enabled to apply a linear transformation to the symbol vector s, so that x=Ws, where W may be of dimension NTX by length of s, and x=[x1,x2, . . . xNTX]T. Each element of the pre-coded vector x may be transmitted on a different antenna among NTX available antennas.
The transmitted pre-coded vector x may traverse the MIMO baseband equivalent channel 203. From the NRX receiver antennas, the received signal y may be the signal x transformed by the MIMO baseband equivalent channel 203 represented by a matrix H, plus a noise component given by the noise vector n. As depicted by the adder 208, the received vector y may be given by y=Hx+n=HWs+n. The received vector y may be communicated to the pre-coding decoding block 216, where a linear decoding operation B may be applied to the received vector y to obtain the decoded vector y′=BHy=BHHWs+BHn, where B may be a complex matrix of appropriate dimensions. The decoded vector y′ may then be communicated to the RX baseband processing block 220 where further signal processing may be applied to the output of the pre-coding decoding block 216.
If the transfer function H of the MIMO baseband equivalent channel 203 that may be applied to the transmitted pre-coded vector x is known both at the MIMO transmitter 202 and the MIMO receiver 204, the channel may be diagonalized by, for example, setting W=V and B=U, where H=UΣVH may be the singular value decomposition. In these instances, the channel decoded vector y′ may be given by the following relationship:

y′=UHUΣVHVs+UHn=Σs+UHn 

Since Σ may be a diagonal matrix, there may be no interference between the elements of symbol vector s in y′ and hence the wireless communications system may appear like a system with up to NTX parallel single antenna wireless communication systems, for each element of s, up to the rank of channel matrix H which may be less or equal to NTX.

FIG. 3 is a block diagram of an exemplary MIMO pre-coding system with finite rate channel state information feedback, in accordance with an embodiment of the invention. Referring to FIG. 3, there is shown a MIMO pre-coding system 300 comprising a partial MIMO transmitter 302, a partial MIMO receiver 304, a Wireless channel 306, an adder 308, and a feedback channel 320. The partial MIMO transmitter 302 may comprise a transmit pre-coding block 314. The partial MIMO receiver 304 may comprise a pre-coding decoding block 316, a channel estimation block 322, a channel quantization block 310, a channel decomposition block 312, and a codebook processing block 318. There is also shown a symbol vector s, a pre-coded vector x, a noise vector n, a received vector y, and a decoded vector y′.
The transmit pre-coding block 314, the wireless channel 306, the adder 308 and the pre-coding decoding block 316 may be substantially similar to the transmit pre-coding block 214, the MIMO baseband equivalent channel 203, the adder 208 and the pre-coding decoding block 216, illustrated in FIG. 2. The channel estimation block 322 may comprise suitable logic, circuitry and/or logic to estimate the transfer function of the wireless channel 206. The channel estimate may be communicated to the channel decomposition block 312 that may be enabled by suitable logic, circuitry and/or code, to decompose the channel. In this respect, the decomposed channel may be communicated to the channel quantization block 310. The channel quantization block 310 may comprise suitable logic, circuitry and/or logic to partly quantize the channel onto a codebook. The codebook processing block 318 may comprise suitable logic, circuitry and/or logic that may be enabled to generate a codebook. The feedback channel 320 may represent a channel that may be enabled to carry channel state information from the partial MIMO receiver 304 to the partial MIMO transmitter 302.
In many wireless systems, the channel state information, that is, knowledge of the channel transfer matrix H, may not be available at the transmitter and the receiver. However, in order to utilize a pre-coding system as illustrated in FIG. 2, it may be desirable to have at least partial channel knowledge available at the transmitter. In the exemplary embodiment of the invention disclosed in FIG. 2, the MIMO transmitter 302 may require the unitary matrix V for pre-coding in the transmit pre-coding block 214 of MIMO transmitter 202.
In frequency division duplex (FDD) systems, the frequency band for communications from the base station to the mobile terminal, downlink communications, may be different from the frequency band in the reverse direction, uplink communications. Because of a difference in frequency bands, a channel measurement in the uplink may not generally be useful for the downlink and vice versa. In these instances, the measurements may only be made at the receiver and channel state information (CSI) may be communicated back to the transmitter via feedback. For this reason, the CSI may be fed back to the transmit pre-coding block 314 of the partial MIMO transmitter 302 from the partial MIMO receiver 304 via the feedback channel 320. The transmit pre-coding block 314, the wireless channel 306, and the adder 308 are substantially similar to the corresponding blocks 214, 203 and 208, illustrated in FIG. 2.
At the partial MIMO receiver 304, the received signal y may be used to estimate the channel transfer function H by Ĥ in the channel estimation block 322. The estimate may further be decomposed into, for example, a diagonal or triangular form, depending on a particular receiver implementation, as explained for FIG. 2. For example, the channel decomposition block 312 may perform an SVD: Ĥ=Û{circumflex over (Σ)}{circumflex over (V)}H. The matrix H and Ĥ may be rank r=NTX matrices. This may be the case when the number of transmit antennas is smaller than the number of receive antennas, that is, NTX≦NRX. In the case of a plurality of antennas, the dimensions of the matrices U, Σ and V may grow quickly. In these instances, it may be desirable to quantize the matrix {circumflex over (V)} into a matrix Vk of dimensions NTX by NTX, where Vk Vk−1·Qq0 may be generated from the last Vk, that is Vk−1 and a unitary rotation matrix Qq0 from a pre-defined finite set of unitary matrices Cd={Qi}. The set of unitary matrices Cd may be referred to as the codebook. The matrix {circumflex over (V)} may change relatively slowly with respect to the channel update rate. In these instances, it may be more economical to send an update to the previous quantized matrix Vk−1 instead of a new matrix Vk and utilize channel memory. By finding a matrix Qq0 from the codebook Cd that may generate a Vk that may be, in some sense, closest to the matrix {circumflex over (V)} it may suffice to transmit the index q of the matrix Qq0 to the transmit pre-coding block 314. This may be achieved via the feedback channel 320 from the channel quantization block 310. The partial MIMO transmitter 302 may need to know the codebook Cd. The codebook Cd may be varying much slower than the channel transfer function H and it may suffice to periodically update the codebook Cd in the transmit pre-coding block 314 from the codebook processing block 318 via the feedback channel 320. The codebook Cd may be chosen to be static or adaptive. Furthermore, the codebook Cd may also be chosen, adaptively or non-adaptively, from a set of codebooks, which may comprise adaptively and/or statically designed codebooks. In these instances, the partial MIMO receiver 304 may inform the partial MIMO transmitter 302 of the codebook in use at any given instant in time. The matrix {circumflex over (V)} may be quantized into Vk as described by the following relationships:



  
    
      Q
      q
      0
    
    =
    
      
        argmax
        
          
            
              Q
              ^
            
            q
          
          ∈
          
            C
            d
          
        
      
      ⁢
      
        f
        ⁡
        
          (
          
            
              
                V
                ^
              
              H
            
            ⁢
            
              V
              
                k
                -
                1
              
            
            ⁢
            
              
                Q
                ^
              
              q
            
          
          )
        
      
    
  




  
    
      f
      ⁡
      
        (
        A
        )
      
    
    =
    
      (
      
        
          1
          N
        
        ⁢
        
          
            ∑
            
              j
              =
              1
            
            N
          
          ⁢
          
            
              
              
                a
                jj
              
              
            
            2
          
        
      
      )
    
  



where A=[aij] and A may be of dimensions N by N. Hence, the matrix Qq0 may be chosen as the matrix {circumflex over (Q)}q in the codebook Cd that may maximize the function f({circumflex over (V)}HVk−1{circumflex over (Q)}q) as defined above. The function f(.) may average the squared absolute value of the diagonal elements of its input matrix. By maximizing f(.), the matrix Vk may be chosen so that the product {circumflex over (V)}HVk may be most like an identity matrix, in some sense. The expression for f(.) above may maximize the instantaneous capacity of the pre-coded MIMO system under some approximations. Hence, the channel H may be estimated in the channel estimation block 322 and decomposed in the channel decomposition block 312.

In the channel quantization block 310, a matrix, for example {circumflex over (V)} may be quantized into a matrix Vk=Vk−1·Qq0 and the index q may be fed back to the partial MIMO transmitter 302 via the feedback channel 320. Less frequently than the index q, the codebook Cd from the codebook processing block 318 may be transmitted to the partial MIMO transmitter 302 via the feedback channel 320. The codebook Cd may also be chosen time invariant. Furthermore, the codebook Cd may also be chosen, adaptively or non-adaptively, from a set of codebooks, which may comprise adaptively and/or statically designed codebooks. To feedback the index q, M bits may suffice when the cardinality |C| of the codebook C may be less or equal to |C|≦2M.
The transmit pre-coding block 314 may perform, for example, the linear transformation x=Vks. The pre-coding decoding block 316 at the receiver may implement the linear transformation y′=ÛHy.
A codebook Cd may comprise complex unitary matrices {Qq}. A desirable codebook may be one that comprises an easily adjustable dynamic range. This may be interpreted for rotation matrices {Qq} to mean that the absolute range of angles over which the set Cd may rotate may be adaptable or configurable, as may the granularity, that is the step size between neighboring matrices Qq. Adaptability of the dynamic range may allow the codebook to be adapted to a wide variety of different channel conditions. In particular, the codebook Cd may be adapted to the rate of change of the wireless channel matrix H.
One exemplary protocol to construct a codebook Cd may make use of the unitary property of the matrices {Qq}. A square complex unitary matrix Qq may be constructed from a plurality of diagonal matrices Di and a plurality of Givens matrices Gk,l. The matrices {Qq} may be given by the following relationship:




  
    
      
        
          Q
          q
        
        =
        
          
            ∏
            
              i
              =
              1
            
            
              
                N
                TX
              
              -
              1
            
          
          ⁢
          
            [
            
              
                
                  D
                  i
                
                ⁡
                
                  (
                  
                    
                      φ
                      
                        i
                        ,
                        i
                      
                    
                    ,
                    ...
                    ⁢
                    
                      
                    
                    ,
                    
                      φ
                      
                        
                          
                            N
                            TX
                          
                          -
                          1
                        
                        ,
                        i
                      
                    
                  
                  )
                
              
              ⁢
              
                
                  ∏
                  
                    k
                    =
                    
                      i
                      +
                      1
                    
                  
                  
                    N
                    TX
                  
                
                ⁢
                
                  
                    G
                    
                      k
                      ,
                      i
                    
                  
                  ⁡
                  
                    (
                    
                      φ
                      
                        k
                        ,
                        i
                      
                    
                    )
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        1
        )
      
    
  




where the matrices Di may be of the structure given in the following relationship:





  
    
      D
      i
    
    ⁡
    
      (
      
        
          φ
          
            i
            ,
            i
          
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          φ
          
            
              
                N
                TX
              
              -
              1
            
            ,
            i
          
        
      
      )
    
  
  =
  
    [
    
      
        
          
            I
            
              i
              -
              1
            
          
        
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
      
      
        
          0
        
        
          
            e
            
              jφ
              
                i
                ,
                i
              
            
          
        
        
          0
        
        
          ...
        
        
          0
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
        
          0
        
      
      
        
          0
        
        
          0
        
        
          0
        
        
          
            e
            
              jφ
              
                
                  
                    N
                    TX
                  
                  -
                  1
                
                ,
                i
              
            
          
        
        
          0
        
      
      
        
          0
        
        
          0
        
        
          0
        
        
          0
        
        
          1
        
      
    
    ]
  




where the angles φk,l and the index i may define the structure of Di. Ik=Ik may denote an identity matrix of dimensions k by k. The indices k and i and the angle φk,i may determine the matrices Gk,i as shown in the following relationship:





  
    
      G
      
        k
        ,
        i
      
    
    ⁡
    
      (
      
        φ
        
          k
          ,
          i
        
      
      )
    
  
  =
  
    [
    
      
        
          
            I
            
              k
              -
              1
            
          
        
        
          0
        
        
          0
        
        
          ...
        
        
          0
        
      
      
        
          0
        
        
          
            cos
            ⁢
            
              
            
            ⁢
            
              φ
              
                k
                ,
                i
              
            
          
        
        
          0
        
        
          
            sin
            ⁢
            
              
            
            ⁢
            
              φ
              
                k
                ,
                i
              
            
          
        
        
          0
        
      
      
        
          0
        
        
          0
        
        
          
            I
            
              i
              -
              k
              -
              1
            
          
        
        
          0
        
        
          0
        
      
      
        
          0
        
        
          
            
              -
              sin
            
            ⁢
            
              
            
            ⁢
            
              φ
              
                k
                ,
                i
              
            
          
        
        
          0
        
        
          
            cos
            ⁢
            
              
            
            ⁢
            
              φ
              
                k
                ,
                i
              
            
          
        
        
          0
        
      
      
        
          0
        
        
          0
        
        
          0
        
        
          0
        
        
          
            I
            
              
                N
                TX
              
              -
              i
            
          
        
      
    
    ]
  




The angular range in which the aforementioned angles vary may be: φk,iε[−π/2,π/2] and φk,iε[−π,π]. In the case where a given Qq may be an identity matrix, no rotation may take place. Hence, the matrices {Qq} may be close, in some sense, to an identity matrix. A codebook Cd may be constructed as shown in the following relationship:

Cd={Qq(φk,i,φk+1,i;∀1≦i≦k≦NTX−1)|φk,i=±mδ·π/2,φk,i=±nδ·π}

m,nε{0,1,2, . . . Nd}  (2)

where δ≦1/Nd may be the step size. In some instances, m,n≠0 may also be chosen for the construction of the codebook Cd. A codebook Cd may be constructed from a set of matrices {Qq} that may be generated from a number of angles according to equation (1). In an embodiment of the codebook, a set Cd may be constructed that may comprise the matrices {Qd} that may be constructed from possible combinations of the set of angles φk,i=±mδ·π/2,φk,i=±nδ·π as defined in equation (2) and equation (1). From equation (1), it may be seen that the set of Qq matrices may be defined by NTX2−NTX angles φk,i and φk,i. Due to the construction of the codebook in equation (2), each angle may take 2Nd+1 different values. Combining possible angle combinations in {Qq} with possible values that may be assumed by the angles, may lead to a codebook with cardinality |Cd|=(2Nd+1)(NTX2−NTX), that is, |Cd| different matrices Qq may be comprised in the set Cd. In these instances, B=(NTX2−NTX)log2(2Nd+1) bits may be fed back from the partial MIMO receiver 304 to the partial MIMO transmitter 302, to feed back the index q of the choice of matrix Qq0.

For the exemplary case of |Cd|=4, in a 2×2 MIMO system, the feedback rate may be 2 bits per channel update. The step size δ≦1/Nd may permit to adjust the dynamic range of the matrices {Qq}, whereby a wide range of time-varying fading channels matrices H for different rates of change may be accommodated by the above codebook construction.
FIG. 4 is a flow chart illustrating an exemplary implementation of a codebook algorithm, in accordance with an embodiment of the invention. Referring to FIG. 4, there is shown a start step 402, an end step 424, process steps 404, 408, 410, 414, 416, 418, 420 and 422, and decision steps 406 and 412.
An exemplary codebook generation may be started in step 402, generating a codebook as illustrated above. In step 404, variables may be initialized, for example, the step size δ, the number of angular levels Nd, and a counter variable i=1 that may be substantially similar to the index i in equation (1). In step 406, the variable i may be compared to a threshold value determined by the number of transmit antennas NTX. If the variable i is less than NTX−1, the process may generate a set of matrices {Di}. This set {Di} may be generated from matrices Di that may be constructed as described above, that is, from different combination of values for the angles φk,i . . . , φNTX−1,i, φk,i=±mδ·π/2, that may be chosen in the range φk,iε[−π/2,π/2], as described above. In step 410, a counter variable k may be set as a function of i. The variable k may be substantially similar to the variable k in equation (1). In step 412, the variable k may be compared to a threshold determined by NTX. If k is less than NTX, the set of matrices {Gk,i} may be generated. This may be achieved by generating matrices Gk,i, using different values for φk,i=±nδ·π, where the angular range may be defined as described above by φk,iε[−π,π]. In step 416, the variable k may be incremented, and the algorithm may loop back to step 412. If the variable k exceeds NTX in step 412, process step 418 may be executed. In step 418, the generated sets {Di} and {Gk,i} may be combined to form a new set Yi given by the following relationship:




  
    Y
    i
  
  =
  
    {
    
      
        
          D
          i
        
        ⁡
        
          (
          
            
              φ
              
                i
                ,
                i
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              φ
              
                
                  
                    N
                    TX
                  
                  -
                  1
                
                ,
                i
              
            
          
          )
        
      
      ⁢
      
        
          ∏
          
            k
            =
            
              i
              +
              1
            
          
          
            N
            TX
          
        
        ⁢
        
          
            G
            
              k
              ,
              i
            
          
          ⁡
          
            (
            
              φ
              
                k
                ,
                i
              
            
            )
          
        
      
    
    }
  




according to equation (1). The variable i may be incremented in step 420 and the algorithm may loop back to step 406. If the variable i exceeds NTX−1 in step 406, the step 422 may be executed. In step 422, the codebook Cd={Qq} may be generated from the generated sets Yi, according to equation (1). This may complete the codebook generation in the end step 424.

FIG. 5 is a performance line plot of an exemplary 2×2 MIMO system with a 4-element codebook, in accordance with an embodiment of the invention. Referring to FIG. 5, there is shown a spectral efficiency (Bits/sec/Hz) axis and a Signal-to-Noise (SNR) axis. There is also shown a line plot ideal beamforming 502 and a line plot 2-bit codebook 504.
A four element codebook in a 2×2 MIMO system thus may use 2 bits of feedback per channel update. The step size may be chosen δ≦1 As may be seen from FIG. 5, the performance of the 2-bit codebook 504 may be close to the performance of ideal beamforming 502. In the case of ideal beamforming 502, the channel state information, that is the wireless channel H, may be known completely and accurately at the transmit pre-coding block 214 of the transmitter 202. Hence, the performance penalty that may be incurred by using the 2-bit codebook 504 as described above, over perfect channel state information may be relatively small.
In accordance with an embodiment of the invention, a method and system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback may comprise quantizing a change in channel state information in a MIMO pre-coding system 300 onto a codebook which comprises one or more unitary matrices, using a cost function; and generating the codebook based on at least the channel state information, as illustrated in FIG. 3. The channel state information may comprise a matrix V, generated in the channel decomposition block 312, and the cost function f(A) may be defined by the following relationship:




  
    f
    ⁡
    
      (
      A
      )
    
  
  =
  
    (
    
      
        1
        N
      
      ⁢
      
        
          ∑
          
            j
            =
            1
          
          N
        
        ⁢
        
          
            
            
              a
              jj
            
            
          
          2
        
      
    
    )
  




where A is a matrix of size N by N and aij is element (i,j) of matrix A. One or more unitary matrices may be generated, in the codebook processing block 318, from at least a first set of matrices and a second set of matrices, where the first set of matrices may comprise one or more Givens matrices. A dynamic range and a resolution of the codebook may be modified by modifying a step size variable and a cardinality of the codebook, respectively, as illustrated in FIG. 4. The cardinality of the codebook may be modified by modifying a set of angular levels. The MIMO pre-coding system 300, illustrated in FIG. 3, may comprise transmitting an index of an element of the codebook, onto which the change in channel state information is quantized, from a partial MIMO receiver 304 to a partial MIMO transmitter 302. A communication system comprising the MIMO pre-coding system 300 may comprise one or more transmit antennas and one or more receive antennas. The matrix V may be generated from the output of channel estimation 322 in the channel decomposition block 312 using a decomposition method, for example, Singular Value Decomposition (SVD) or a Geometric Mean Decomposition (GMD). At the transmitter, in the transmit pre-coding block 314, of the MIMO pre-coding system 300, (a matrix may be linearly transformed with one of the unitary matrices.

Another embodiment of the invention may provide a machine-readable storage, having stored thereon, a computer program having at least one code section executable by a machine, thereby causing the machine to perform the steps as described above for a method and system for a delta quantizer for MIMO pre-coders with finite rate channel state information feedback.
Accordingly, the present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in at least one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
The present invention may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.
While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims.

## Claims

1. A receiver, comprising:
a processor,
an estimation block, coupled to the processor, configured to generate an estimation matrix of a transfer function associated with a wireless channel;
a decomposition block, coupled to the processor, configured to generate a decomposed estimation matrix by performing singular value decomposition on the estimation matrix;
a quantization block, coupled to the processor, configured to generate a quantized matrix by quantizing a portion of the decomposed estimation matrix, the quantizing including determining a relationship between a previously quantized portion of the decomposed estimation matrix and a unitary matrix; and
a feedback block, coupled to the processor, configured to communicate the unitary matrix to transmitters in communication with the receiver.

2. The receiver of claim 1, wherein the transfer function is associated with channel state information of the wireless channel.

3. The receiver of claim 1, wherein the quantization block is configured to include the previously quantized portion of the decomposed estimation matrix in a codebook, the codebook including the unitary matrix.

4. The receiver of claim 3, further comprising:
a generator block configured to generate the codebook based on the channel state information of the wireless channel.

5. The receiver of claim 3, wherein a step size between two unitary matrices, included in the codebook, is configured to be modifiable to adjust a dynamic range of the codebook.

6. The receiver of claim 3, wherein a cardinality of the codebook is configured to be modifiable to adjust a resolution of the codebook.

7. The receiver of claim 6, wherein the cardinality of the codebook is configured to be modifiable by modifying a set of angular levels associated with the codebook.

8. The receiver of claim 1, wherein, in a subsequent communication, the feedback block is configured to communicate only an update associated with the unitary matrix.

9. The receiver of claim 8, wherein the update is an index associated with the unitary matrix.

10. The receiver of claim 1, wherein the receiver is configured to be included in a multi-input multi-output (MIMO) transceiver.

11. The receiver of claim 1, wherein the relationship between the previously quantized portion of the decomposed estimation matrix and the unitary matrix is given by


Vk=Vk−1*Q, 

wherein Vk is the portion of the decomposed estimation matrix, Vk−1 is the previously quantized portion of the decomposed estimation matrix, and Q is the unitary matrix.

12. A method, comprising:
estimating, in a receiver, an estimation matrix of a transfer function associated with a wireless channel;
generating, in the receiver, a decomposed estimation matrix by performing singular value decomposition on the estimation matrix;
generating, in the receiver, a quantized matrix by quantizing a portion of the decomposed estimation matrix, the quantizing including determing a relationship between a previously quantized portion of the decomposed estimation matrix and a unitary matrix; and
communicating, from the receiver, the unitary matrix to transmitters in communication with the receiver.

13. The method of claim 12, wherein the transfer function is associated with channel state information of the wireless channel.

14. The method of claim 12, wherein the generating the quantized matrix comprises including the previously quantized portion of the decomposed estimation matrix in a codebook, the codebook including at least one unitary matrix.

15. The method of claim 14, further comprising:
generating the codebook based on the channel state information of the wireless channel.

16. The method of claim 14, further comprising:
modifying a step size between two unitary matrices, included in the codebook, to adjust a dynamic range of the codebook.

17. The method of claim 14, further comprising:
modifying a cardinality of the codebook to adjust a resolution of the codebook.

18. The method of claim 17, wherein the modifying the cardinality of the codebook includes modifying a set of angular levels associated with the codebook.

19. The method of claim 12, further comprising:
communicating, in a subsequent communication, only an update associated with the unitary matrix.

20. The method of claim 19, wherein the communicating only the update includes communicating an index associated with the unitary matrix.

21. A receiver, comprising:
a processor;
an estimation block, coupled to the processor, configured to generate an estimation matrix of channel state information associated with a transfer function of a wireless channel;
a decomposition block, coupled to the processor, configured to generate a decomposed estimation matrix by performing singular value decomposition on the estimation matrix;
a quantization block, coupled to the processor, configured to generate a quantized matrix by quantizing a portion of the decomposed estimation matrix, the quantizing including determining a relations between a previously quantized portion of the decomposed estimation matrix and a unitary matrix, and to include the previously quantized portion of the decomposed estimation matrix in a codebook, the codebook including the unitary matrix; and
a feedback block, coupled to the processor, configured to communicate only an index associated with the unitary matrix to transmitters in communication with the receiver.