The present invention relates generally to wireless communication networks, and in particular to a reduced complexity method of calculating a signal to interference and noise ratio (SINR) that avoids matrix inversion calculations.
Wireless communication systems are required to transmit ever-increasing amounts of data, in support of expanded subscriber services, such as messaging, e-mail, music and video streaming, and the like. Transmitting a higher volume of data over a given channel requires transmission at a higher data rate.
One known technique to improve data transmission rates in wireless communications is the use of multiple input, multiple output (MIMO) technology, wherein signals are transmitted from multiple transmit antennas and may be received by multiple receiver antennas. Using advanced coding and modulation schemes, two or more streams of data may be transmitted simultaneously to a receiver, increasing the data rate.
Maintaining high data rates in MIMO systems requires fast link adaptation. That is, the transmitter must constantly alter its selection of transmission parameters, such as the modulation and coding scheme selected, or antenna configuration, based on the current characteristics of the channel, which can change rapidly. In a Frequency Division Duplex (FDD) system, the instantaneous downlink channel conditions are not available at the base station, and must be determined by a receiver and communicated to the base station. In Wideband CDMA (WCDMA) and Long Term Extension (LTE), the instantaneous downlink channel conditions are communicated to the base station through a Channel Quality Indicator (CQI).
Estimating the CQI is a delicate task, which involves a calculation of a signal to interference and noise ratio (SINR). For a multi-stream transmission, estimating the SINR is a more complex task than estimating the SINR for a single-stream transmission, due to the inter-stream interference. Traditional SINR estimation techniques involve summing the noise and respective inter-stream interferences (a matrix quantity) to obtain an impairments matrix, and then inverting the matrix to calculate an inverse impairments matrix. The impairments matrix is of size nrx×nrx, where nrx is the number of receive antennas. Matrix inversion is a computationally intensive mathematical operation. The limited computing resources (and power budget) of a mobile receiver restrict the frequency with which the CQI can be calculated and communicated to a base station, thus reducing the link adaptation rate, which places an upper bound on the available data rate.
According to one or more embodiments disclosed herein, a recursive method of calculating an inverse impairments matrix is used to generate an SINR estimate, which in turn is used to generate a CQI estimate. The recursive inverse impairments matrix calculation avoids the need to perform a matrix inversion, allowing for faster CQI estimate generation and consuming less power.
One embodiment relates to a method of estimating a SINR in a wireless communication network transmitting data in a plurality of streams from one or more transmit antennas to one or more receive antennas, without performing a matrix inversion calculation in a receiver to obtain an inverse impairment matrix. Channel conditions from each transmit antenna to each receive antenna are estimated and a matrix of estimated channel noise covariance is generated. An initial inverse impairment matrix for a given pilot position is calculated based on the channel conditions and the channel noise covariance. An inverse impairment matrix is recursively calculating for the pilot position by recursively summing the noise and inter-stream interference, beginning with the initial inverse impairment matrix. An SINR is then calculated based on the recursively calculated inverse impairment matrix.
A noise covariance matrix R, of dimension 4×4, is also generated (block 36). R is generally diagonal with entries σ2 (j), j=0, . . . , 3. The entries σ2 (j), j=0, . . . , 3 may for example represent, but are not limited to, thermal noise, other system interference, inter-cell interference and intra-cell interference resulting from transmission to other users.
Note that R is not necessarily diagonal. In the case that R is not diagonal, several options exist that still reduce the computational complexity of calculating an inverse impairments matrix. First, a matrix inversion of R may be performed, using the structure of R and some applicable matrix algebra, resulting in a computationally simpler matrix inversion method than the general case, and building the remaining of the inverse impairments matrix without matrix inversions. As another option, R may be rounded to a diagonal matrix, since in most practical cases, it will be almost diagonal. Still another option is to let σ2 in R be an arbitrary low number, implicitly assuming that the inter-stream interference is dominating other interference.
VAC(k) is a vector containing the Virtual Antenna Combination of antennas used for transmission using Virtual Antenna Identifier VAI=k. In the case of four transmit antennas, VAC is a subset of the integers {0, 1, 2, 3}. The complete sets of combinations are listed in Table 1 below. Fifteen different sets exist, hence VAI=0, . . . , 14.
As an example, h(VAC(9)(2))(p) is the vector channel (i.e., the channel response at all RX antennas) at pilot position p from transmit antenna VAC(9)(2)={2,3}(2)=3, i.e., the second element of the VAC corresponding to VAI=9.
ns(k) is the number of streams used for VAI=k, as shown in Table 2 below.
PD/P(k) denotes the offset between data and pilot power for VAI=k, such that Pdata=PD/P(k)Ppilot
SINR for stream s for VAI=k, pilot p, can be written as
SINR(k)(s)(p)=PD/P(k)h*(VAC(k)(s))(p)Q(k)(s)(p)h(VAC(k)(s))(p)
with the inverse impairments matrix
Q(k)(s)(p)=(Σj≠sPD/P(k)h(VAC(k)(j)(p)h*(VAC(k)(j))(p)+R)−1
where the operator x* denotes the complex conjugate transpose of x. The matrix inversion operation is computationally complex.
According to one or more embodiments of the present invention, the impairments matrix may be written recursively as
(Q(k)(s)(p)(i))−1=(Q(k)(s)(p)(i-1))−1+PD/P(k)hihi*,i=0, . . . , ns(k)−1
using the simplified notation
hi=h(VAC(k)((s+i)mod ns(k)))(p) where mod is the modulo operator.
An initial inverse impairment matrix for a given pilot position is calculated (block 38) as
Q(k)(s)(p)(0)=R−1. Since R is diagonal, it is easily inverted using only scalar inversions.
Using the matrix inversion lemma, one can write:
for i=0, . . . , ns(k)−1, with Q(k)(s)(p)(0) being a diagonal matrix with entries 1/σ2(j), j=0, . . . , 3.
This inverse impairments matrix is recursively calculated (block 40), over all streams (block 42). The SINR(k)(s)(p) is then determined (block 44) as
SINR(k)(s)(p)=PD/P(k)h0*Q(k)(s)(p)(n
The method is then repeated for the next pilot position (block 46). Alternatively, as depicted in
The entire method 30 or 50 can be performed using only matrix times vector multiplications and inner/outer vector products. No matrix inversion calculation is required. Accordingly, the method may be utilized by UE 12 to calculate SINR estimates more rapidly, with fewer computational resources, and consuming less power, then by known techniques (i.e., those involving matrix inversions). As a result, CQI estimates may be generated more rapidly, allowing faster link adaptation and higher data rates.
Although the inventive processing has been disclosed herein in the context of downlink channel estimation by a UE, those of skill in the art will readily recognize that the same processing may be employed by a receiver in a base station, to perform uplink channel estimation.
The present invention may, of course, be carried out in other ways than those specifically set forth herein without departing from essential characteristics of the invention. The present embodiments are to be considered in all respects as illustrative and not restrictive, and all changes coming within the meaning and equivalency range of the appended claims are intended to be embraced therein.
This application claims priority to U.S. Provisional Patent Application Ser. No. 61/037,918, filed Mar. 19, 2008, and incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5012193 | Chen | Apr 1991 | A |
5500856 | Nagase et al. | Mar 1996 | A |
6301293 | Huang et al. | Oct 2001 | B1 |
6405036 | Almgren et al. | Jun 2002 | B1 |
6496749 | Yamaguchi et al. | Dec 2002 | B1 |
6496941 | Segal et al. | Dec 2002 | B1 |
6510321 | Ritzen et al. | Jan 2003 | B2 |
6671338 | Gamal et al. | Dec 2003 | B1 |
6775260 | Dabak et al. | Aug 2004 | B1 |
6856643 | Yang et al. | Feb 2005 | B1 |
6892073 | Fattouch | May 2005 | B2 |
6975666 | Affes et al. | Dec 2005 | B2 |
7027533 | Abe et al. | Apr 2006 | B2 |
7054635 | Ritzen et al. | May 2006 | B1 |
7200183 | Olson et al. | Apr 2007 | B2 |
7558223 | Shirakata et al. | Jul 2009 | B2 |
7565114 | Ito et al. | Jul 2009 | B2 |
7671800 | Lee | Mar 2010 | B2 |
7773949 | Je et al. | Aug 2010 | B2 |
7808937 | McCloud et al. | Oct 2010 | B2 |
7881412 | Banister | Feb 2011 | B2 |
20070298718 | Je et al. | Dec 2007 | A1 |
20080240304 | Oh et al. | Oct 2008 | A1 |
20110069742 | Narayan et al. | Mar 2011 | A1 |
Number | Date | Country |
---|---|---|
2006138135 | Dec 2006 | WO |
Number | Date | Country | |
---|---|---|---|
20090239474 A1 | Sep 2009 | US |
Number | Date | Country | |
---|---|---|---|
61037918 | Mar 2008 | US |