This application is U.S. National Stage entry under 35 U.S.C. § 371 of PCT International Application Ser. No. PCT/GB2004/003368 (International Publication No. WO 2005/015790 A1 and titled “Method and arrangement for noise variance and SIR estimation”) filed on Aug. 5, 2004, which claims benefit of UK Patent Application No. GB 0318529.5 (UK Publication No. GB 2 404 882 A and titled “Method and arrangement for noise variance and SIR estimation”) filed on Aug. 7, 2003, both from applicant IPWireless and both of which are incorporated herein by reference in their entirety.
This invention relates to noise variance and signal/interference ratio (SIR) estimation, and particularly though not exclusively to such estimation in wireless communication receivers. It will be understood that, as used herein, the terms ‘noise’ and ‘interference’ are to be considered synonymous, with each encompassing both noise and interference.
In the field of this invention it is known that many parts of a wireless communications receiver often require an estimation of noise variance and/or SIR. This is needed for purposes of power control, threshold determination for various algorithms, quantisation of soft-decision information for channel decoding purposes to name but a few.
For BPSK (Binary Phase Shift Key) and QPSK (Quadrature Phase Shift Key) modulation the conventional method for estimating the SIR at the output of a detector relies on estimating output noise variance using the following equality known (for example) from the publication by Papoulis and Pillai, entitled ‘Probability, Random Variables and Stochastic Processes’, 3rd Ed. 1991,
{circumflex over (σ)}z2=E(|{circumflex over (d)}n(k)|2)−E(|{circumflex over (d)}n(k)|)2
where {circumflex over (σ)}z2 represents variance, E represents mean value and {circumflex over (d)}n(k) the detector output.
This yields the following result:
where SIR represents the SIR of the kth sequence at the detector output, and P(k) represents the average power of the kth sequence at the detector output.
However, this approach has the disadvantage(s) that the accuracy of this method at low SIR is poor since it suffers from a bias term. An analysis of the bias term and a correction method has been suggested in UK Patent Application GB 0128475.1 (UK Publication No. GB 2 382 748 A and titled “Signal to noise plus interference ration (SNIR) estimation with correction factor” to applicant IPWireless) filed on Nov. 28, 2001. However, the suggested correction method requires a look-up table to correct for the aforementioned problem, and the estimation variance is also increased when correcting the bias.
A need therefore exists for a method and arrangement for noise variance and SIR estimation wherein the abovementioned disadvantage(s) may be alleviated.
In accordance with embodiments of the present invention there is provided a method for noise variance estimation, user equipment, base station, computer program product, communication system and an integrated circuit as claimed.
In some embodiments, the second noise variance signal is produced by applying to the first noise variance signal a function substantially equal to the detector's transfer function.
In some embodiments, the first noise variance signal is derived from a midamble portion of the received signal.
In some embodiments, an estimate of total power at the detector output is produced from the second noise variance signal and an SIR signal representative of SIR in the received signal.
One method and arrangement for noise variance and SIR estimation incorporating the present invention will now be described, by way of example only, with reference to the accompanying drawings, in which:
The following preferred embodiment of the present invention will be described in the context of a 3GPP (3rd Generation Partnership Project) UMTS (Universal Mobile Telecommunication System) Radio Access Network (UTRAN) system operating in TDD mode. Referring firstly to
In the terminal/user equipment domain 110, terminal equipment (TE) 112 is connected to mobile equipment (ME) 114 via the wired or wireless R interface. The ME 114 is also connected to a user service identity module (USIM) 116; the ME 114 and the USIM 116 together are considered as a user equipment (UE) 118. The UE 118 communicates data with a Node B (base station) 122 in the radio access network domain 120 via the wireless Uu interface. Within the radio access network domain 120, the Node B 122 communicates with a radio network controller (RNC) 124 via the Iub interface. The RNC 124 communicates with other RNC's (not shown) via the Iur interface. The Node B 122 and the RNC 124 together form the UTRAN 126. The RNC 124 communicates with a serving GPRS service node (SGSN) 132 in the core network domain 130 via the Iu interface. Within the core network domain 130, the SGSN 132 communicates with a gateway GPRS support node (GGSN) 134 via the Gn interface; the SGSN 132 and the GGSN 134 communicate with a home location register (HLR) server 136 via the Gr interface and the Gc interface respectively. The GGSN 134 communicates with public data network 138 via the Gi interface.
Thus, the elements RNC 124, SGSN 132 and GGSN 134 are conventionally provided as discrete and separate units (on their own respective software/hardware platforms) divided across the radio access network domain 120 and the core network domain 130, as shown the
The RNC 124 is the UTRAN element responsible for the control and allocation of resources for numerous Node B's 122; typically 50 to 100 Node B's may be controlled by one RNC. The RNC also provides reliable delivery of user traffic over the air interfaces. RNC's communicate with each other via the Iur interface.
The SGSN 132 is the UMTS Core Network element responsible for Session Control and interface to the HLR. The SGSN keeps track of the location of an individual UE and performs security functions and access control. The SGSN is a large centralised controller for many RNCs.
The GGSN 134 is the UMTS Core Network element responsible for concentrating and tunnelling user data within the core packet network to the ultimate destination (e.g., internet service provider—ISP).
Such a UTRAN system and its operation are described more fully in the 3GPP technical specification documents 3GPP TS 25.401, 3GPP TS 23.060, and related documents, available from the 3GPP website, and need not be described in more detail herein.
The physical layer of UTRA TDD mode provides physical channels that carry transport channels from the MAC (Medium Access Control) sub-layer of UMTS Layer 2. A physical channel is defined by frequency, timeslot, channelisation code, burst type, and radio frame allocation. In UMTS Layer 2, in each time slot, three burst structures (as shown generically in
The data fields contain the data symbols from the transport channels, after the processes of coding, multiplexing, interleaving, and modulation. The midamble field contains the training sequence, which is used in a number of Layer 1 algorithms, such as channel estimation. The guard period, GP, is used to accommodate any timing inaccuracies, from propagation delays, channel dispersion, and power ramping in the transmitter. The different burst types and their associated field lengths in chips are given in the table below:
The received sequence in the data payload areas of the burst is given by
e=Ad+n
where
d=(d(1)T, d(2)T, . . . , d(K)T)T=(d1, d2, . . . , dKN)T,
(.)T denotes transposition, K is the number of data sequences k=1, . . . ,K, and N is the number of symbols per data sequence n=1, . . . ,N. The data sequence for the kth user is given by d(k)=(d1(k), d2(k), . . . , dN(k))T. The noise sequence n, denoted by n=(n1, n2, . . . , nNQ+W−1)T, has zero mean and covariance matrix Rn=E(nnH), where (.)H denotes conjugate transposition. The matrix has dimensions (NQ+W−1)×KN and the elements are given by:
where b(k)=h(k)*c(k), h(k) is the impulse response of the kth user, W is the length of the channel impulse response, * denotes discrete time convolution, c(k) is the spreading code of the kth user and Q is the length of the spreading sequence in chips.
The output of the detector is given by
{circumflex over (d)}=f(e)=r+z
where f(.) denotes the transfer function of the detector, the vector r contains the desired symbols, and the vector z contains noise plus interference. The average power for the kth sequence at the output of the detector is given by
p(k)=E(|{circumflex over (d)}n(k)|2)
Expanding p(k) produces
p(k)=E(|rn+(k−1)Q|2)+E(rn+(k−1)Qz*n+(k−1)Q)+E(r*n+(k−1)Qzn+(k−1)Q)+E(|zn+(k−1)Q|2)
Under the assumption that the noise is uncorrelated with the signal vector r, the average power for the kth sequence becomes
p(k)=E(|rn+(k−1)Q|2)+σz2
where E(.) is the statistical average, σz2=E(|zn+(k−1)Q|2) is the noise variance at the output of the detector, and E(|rn+(k−1)Q|2) is the signal power for the kth sequence. The SIR at the output of the detector for the kth sequence is therefore given by
The conventional method for estimating the SIR relies on estimating the detector output noise variance using the following equality mentioned above:
{circumflex over (σ)}s2=E(|{circumflex over (d)}n(k)|2)−E(|{circumflex over (d)}n(k)|)2
to yield the following result:
As discussed above, the accuracy of this approach at low SIR is poor since it suffers from a bias term, which may be corrected by use of a look-up table.
As will be discussed in greater,detail below, the following preferred embodiments of the present invention do not suffer from such a bias term and therefore do not require a look-up table to correct for the aforementioned problem.
Referring now to
The estimated output noise variance then allows an improved estimate of the SIR (SIR(1). . . SIR(k)) at the detected output. Typically, the SIR at the output of the detector is used for deriving soft decision quantisation levels for application to channel decoding algorithms.
In the following description, two types of CDMA (Code Division Multiple Access) detector are considered, namely single user detector (SUD) and multiuser detector (MUD). It will be understood that the invention is also applicable to other types of detector such as a RAKE receiver.
The technique described here is based on first estimating the noise variance at the input to the detector and then mapping the input noise variance to the output noise variance using the transfer function of the detector.
The process of estimating the noise variance at the input to the detector is carried out using the midamble portion of the burst. Considering the received sequence of chip spaced samples e=(e1, e2, . . . , eL
where
{circumflex over (σ)}2=E(|(eW, eW+1, . . . , eX)−(ēW, ēW+1, . . . , ēX)|2)
where X≦Lm and the starting position is W since the first W−1 samples from the midamble portion of the burst are corrupted by the data portion of the burst.
Multiuser Detection
Under the assumption that the noise is white with variance σ2, the Minimum Mean Squared Error (MMSE) block linear equalizer solution to symbol estimation is given (as known from the publication of Klein, Kaleh and Baier entitled ‘Zero Forcing and Minimum Mean-Square-Error Equalization for Mutliuser Detection in Code-Division Multiple-Access Channels’ in IEEE Trans VT, VOL. 45, No. 2, May 1996, pp276-287) by
{circumflex over (d)}=(AHA+σ2I)−1AHe=f(e)=r+z
where I is the identity matrix and
r=(AHA+σ2I)−1AHAd=(r1, r2, . . . rKN)T (1)
z=(AHA+σ2I)−1AHn=(z1, z2, . . . , zKN)T (2)
From equation (2), the noise variance seen at the output of the MUD is given by
σz2=E(|zn+(k−1)Q|2)=(∥b(k)∥2+σ2)−3∥b(k)∥2σ2
where ∥.∥ denotes vector norm, and σ2 represents the noise variance at the input of the MUD. By replacing σ2 with the estimate of the MUD input noise variance {circumflex over (σ)}2, we have a direct method for estimating the MUD output noise variance {circumflex over (σ)}z2. For completeness, the estimate {circumflex over (σ)}z2 of the MUD output noise variance can be written as
{circumflex over (σ)}z2=f({circumflex over (σ)}2)=(∥b(k)∥2+{circumflex over (σ)}2)−2∥b(k)∥2{circumflex over (σ)}2
where f({circumflex over (σ)}2) represents the noise transfer function of the detector.
Using the new estimate for the output noise variance, the SIR at the output of the MUD for the kth sequence is defined by
where the error term δ({circumflex over (σ)}2) is given by
It is clear from the above set of equations that when {circumflex over (σ)}2=σ2 we have the following
It will therefore be understood that the accuracy of the above technique is directly related to the quality of the noise variance estimate, {circumflex over (σ)}2, at the input of the MUD.
Single User Detection
For the single user detector case the received sequence is written as
e=Ad+n=HCd+n
The matrix H has dimensions (NQ+W−1)×NQ and its elements are given by
where h=(h1, h2, . . . , hW)T, i=1, . . . , NQ+W−1 , and v=1, . . . , NQ. The matrix C has dimensions NQ×KN and its elements are given by
For Minimum Mean Squared Error (MMSE) symbol estimation and under the assumption that the noise is white with variance σ2, the output of the SUD is given by
{circumflex over (d)}=CH(HHH+σ2I)−1HHe=f(e)=r+z
where
r=CH(HHH+σ2I)−1HHHCd=(r1, r2, . . . rKN)T (3)
z=CH(HHH+σ2I)−1HHn=(z1, z2, . . . , zKN)T (4)
From equation (4), the noise variance seen at the output of the SUD is given by
σz2=E(|zn+(k−1)Q|2)=G×(∥h∥2+σ2)−2∥h∥2σ2
where ∥.∥ denotes vector norm, the multiplier G comes from the matrix C, and in general G=∥c(k)∥2=Q.
By replacing σ2 with the estimate of the SUD input noise variance {circumflex over (σ)}2, we have a direct method for estimating the SUD output noise variance σz2. For completeness, the estimate {circumflex over (σ)}z2 of the SUD output noise variance can be written as
{circumflex over (σ)}z2=f({circumflex over (σ)}2)=Q×(∥h∥2+{circumflex over (σ)}2)−2∥h∥2{circumflex over (σ)}2
where G is replaced with Q and f({circumflex over (σ)}2) is the noise transfer function of the detector. Using the new estimate for the output noise variance, the SIR at the output of the SUD for the kth sequence is defined by
where the error term δ({circumflex over (σ)}2) is given by
It is clear from the above set of equations that when {circumflex over (σ)}2=σ2 we have the following
It will therefore be understood that the accuracy of the above technique is directly related to the quality of the noise variance estimate, {circumflex over (σ)}2, at the input of the SUD.
It will be appreciated that the method described above for noise variance and SNIR estimation may be carried out in software running on a processor (not shown—e.g., in User Equipment such as 118 or a Node B such as 122), and that the software may be provided as a computer program element carried on any suitable data carrier (also not shown) such as a magnetic or optical computer disc.
It will be also be appreciated that the arrangement described above for noise variance and SNIR estimation may alternatively be carried out in hardware, for example in the form of an integrated circuit (not shown) such as an FPGA (Field Programmable Gate Array) or ASIC (Application Specific Integrated Integrated Circuit).
It will be understood that the method and arrangement for noise variance and SIR estimation described above provides the following advantages that the accuracy of this technique is not poor at low SIR, since it does not suffer from a bias term, nor does it require correction therefor using a look-up table. An additional advantage is that any increase in estimation variance resulting from bias correction may be avoided.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/GB2004/003368 | 8/5/2004 | WO | 00 | 3/12/2007 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2005/015790 | 2/17/2005 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5214675 | Mueller et al. | May 1993 | A |
5278871 | Rasky et al. | Jan 1994 | A |
5343496 | Honig et al. | Aug 1994 | A |
5351274 | Chennakeshu et al. | Sep 1994 | A |
5406593 | Chennakeshu et al. | Apr 1995 | A |
5566165 | Sawahashi et al. | Oct 1996 | A |
5648983 | Kostic et al. | Jul 1997 | A |
5802446 | Giorgi et al. | Sep 1998 | A |
5987069 | Furukawa et al. | Nov 1999 | A |
6078796 | Ling | Jun 2000 | A |
6157820 | Sourour et al. | Dec 2000 | A |
6167039 | Karlsson et al. | Dec 2000 | A |
6167095 | Furukawa et al. | Dec 2000 | A |
6181739 | Ryde et al. | Jan 2001 | B1 |
6292519 | Popovic | Sep 2001 | B1 |
6370397 | Popovic et al. | Apr 2002 | B1 |
6373878 | Palenius et al. | Apr 2002 | B1 |
6377607 | Ling et al. | Apr 2002 | B1 |
6408023 | Abdesselem et al. | Jun 2002 | B1 |
6408189 | Nakamura et al. | Jun 2002 | B1 |
6463105 | Ramesh | Oct 2002 | B1 |
6510143 | Bejjani et al. | Jan 2003 | B1 |
6539214 | Lapaille et al. | Mar 2003 | B1 |
6542562 | Ostberg et al. | Apr 2003 | B1 |
6707864 | Kim | Mar 2004 | B2 |
6731622 | Frank et al. | May 2004 | B1 |
6816470 | Kim et al. | Nov 2004 | B2 |
6882619 | Gerakoulis | Apr 2005 | B1 |
6891897 | Bevan et al. | May 2005 | B1 |
6928102 | Zeira et al. | Aug 2005 | B2 |
6956888 | Zhengdi | Oct 2005 | B2 |
6975669 | Ling et al. | Dec 2005 | B2 |
6980602 | Kleinerman et al. | Dec 2005 | B1 |
6996160 | Li et al. | Feb 2006 | B2 |
6996385 | Messier et al. | Feb 2006 | B2 |
6999634 | Hong | Feb 2006 | B2 |
7010019 | Reial | Mar 2006 | B2 |
7042929 | Pan et al. | May 2006 | B2 |
7042967 | Reznik et al. | May 2006 | B2 |
7054300 | Pan et al. | May 2006 | B2 |
7075969 | Zeira et al. | Jul 2006 | B2 |
7088978 | Hui et al. | Aug 2006 | B2 |
7092431 | Maeda et al. | Aug 2006 | B2 |
7151761 | Palenius | Dec 2006 | B1 |
7184497 | Jeske et al. | Feb 2007 | B2 |
7190665 | Warke et al. | Mar 2007 | B2 |
7228146 | Banerjee | Jun 2007 | B2 |
7277474 | Sharma et al. | Oct 2007 | B2 |
7283790 | Chevalier et al. | Oct 2007 | B2 |
7286514 | Bar-Ness et al. | Oct 2007 | B2 |
7313172 | Pan et al. | Dec 2007 | B2 |
7317751 | Kyosti | Jan 2008 | B2 |
7349379 | Schmidl et al. | Mar 2008 | B2 |
7349463 | Pajukoski et al. | Mar 2008 | B1 |
7349667 | Magee et al. | Mar 2008 | B2 |
7369523 | Papasakellariou et al. | May 2008 | B2 |
7372402 | Numminen | May 2008 | B2 |
7376176 | Zhao et al. | May 2008 | B2 |
7386030 | Asghar et al. | Jun 2008 | B2 |
7386033 | Pan et al. | Jun 2008 | B2 |
7386057 | Ito et al. | Jun 2008 | B2 |
7408978 | Pan et al. | Aug 2008 | B2 |
7411997 | Umeno et al. | Aug 2008 | B2 |
7428270 | Dubuc et al. | Sep 2008 | B1 |
7440524 | Hwang et al. | Oct 2008 | B2 |
7447255 | De et al. | Nov 2008 | B2 |
7453933 | Jeske et al. | Nov 2008 | B2 |
7457379 | Yang et al. | Nov 2008 | B2 |
7460580 | Pan et al. | Dec 2008 | B2 |
7474640 | Doron et al. | Jan 2009 | B2 |
7492750 | Kim et al. | Feb 2009 | B2 |
7492837 | Tiirola et al. | Feb 2009 | B2 |
20020057730 | Karlsson et al. | May 2002 | A1 |
20020057735 | Piirainen | May 2002 | A1 |
20020097785 | Ling et al. | Jul 2002 | A1 |
20020136188 | Kim | Sep 2002 | A1 |
20030022626 | Miquel et al. | Jan 2003 | A1 |
20030026236 | De et al. | Feb 2003 | A1 |
20030026325 | De et al. | Feb 2003 | A1 |
20030043767 | Pan et al. | Mar 2003 | A1 |
20030078024 | Magee et al. | Apr 2003 | A1 |
20030081658 | Messier et al. | May 2003 | A1 |
20030086380 | Kim et al. | May 2003 | A1 |
20030104797 | Webster et al. | Jun 2003 | A1 |
20030198279 | Zeira et al. | Oct 2003 | A1 |
20030210667 | Zhengdi | Nov 2003 | A1 |
20030236080 | Kadous et al. | Dec 2003 | A1 |
20040032917 | Hwang et al. | Feb 2004 | A1 |
20040033791 | Schmidl et al. | Feb 2004 | A1 |
20040053592 | Reial | Mar 2004 | A1 |
20040102203 | Tiirola et al. | May 2004 | A1 |
20040120300 | Saquib | Jun 2004 | A1 |
20040131109 | Kim et al. | Jul 2004 | A1 |
20040146095 | Umeno et al. | Jul 2004 | A1 |
20040198296 | Hui et al. | Oct 2004 | A1 |
20040264591 | Malm et al. | Dec 2004 | A1 |
20040264604 | Malette et al. | Dec 2004 | A1 |
20050013350 | Coralli et al. | Jan 2005 | A1 |
20050084043 | Yang et al. | Apr 2005 | A1 |
20050094740 | Borran et al. | May 2005 | A1 |
20050102600 | Anandakumar | May 2005 | A1 |
20050141466 | Krupka | Jun 2005 | A1 |
20050181731 | Asghar et al. | Aug 2005 | A1 |
20050201499 | Jonsson | Sep 2005 | A1 |
20050265291 | Bar-Ness et al. | Dec 2005 | A1 |
20050286406 | Jeon et al. | Dec 2005 | A1 |
20060007895 | Coralli et al. | Jan 2006 | A1 |
20060012518 | Numminen | Jan 2006 | A1 |
20060023636 | Farhang-Boroujeny et al. | Feb 2006 | A1 |
20060089559 | Barbieri et al. | Apr 2006 | A1 |
20060126761 | Bernhardsson et al. | Jun 2006 | A1 |
20060135101 | Binshtok et al. | Jun 2006 | A1 |
20060146763 | Supplee et al. | Jul 2006 | A1 |
20060171418 | Casini et al. | Aug 2006 | A1 |
20060233223 | Pan et al. | Oct 2006 | A1 |
20070040704 | Smee et al. | Feb 2007 | A1 |
20070041428 | Wang et al. | Feb 2007 | A1 |
20070076643 | Yang et al. | Apr 2007 | A1 |
20070286292 | Moelker et al. | Dec 2007 | A1 |
20070291641 | Pan et al. | Dec 2007 | A1 |
20080062860 | Kwak et al. | Mar 2008 | A1 |
20080095216 | Pan et al. | Apr 2008 | A1 |
Number | Date | Country |
---|---|---|
2365282 | Feb 2002 | GB |
2382748 | Apr 2003 | GB |
2404822 | Sep 2005 | GB |
Number | Date | Country | |
---|---|---|---|
20070207741 A1 | Sep 2007 | US |