Patent Grant
7869493
The invention relates to a method for detecting a signal, a detector and a computer program product.
In mobile communications, high user capacities and high data rates are desirable. To achieve this, mobile radio systems have to be highly spectral efficient. Using multicarrier modulation according to OFDM (orthogonal frequency division multiplexing) robust performance and high spectral efficiency can be achieved.
Before the OFDM modulation, a pre-transform can be carried out, resulting in a so-called PT-OFDM (pre-transform OFDM) system.
In [1] (and also in [2]), an iterative detection algorithm for a PT-OFDM system is described. This will be described in the following.
An iteration (corresponding to an iteration index i) of the iterative detection algorithm corresponds to three stages, a reconstruction step, a linear filtering step and a decision step.
In the ith reconstruction step, i.e. in the reconstruction step of the iteration corresponding to the iteration index i, the mith component of the received signal r (received signal vector) is estimated. This is done by using the previously detected symbol {circumflex over (x)}i−1 (i.e. the signal vector detected in the previous iteration). mi corresponds to the frequency domain channel with the ith smallest amplitude. In the filtering step, the cross interference of the data is removed by a linear filter denoted by G. In the detection step, a tentative (hard or soft) decision (denoted by dec(.)) is made to generate the symbol detected in the ith iteration, {circumflex over (x)}i.
The algorithm is initialized with r0=r, {tilde over (x)}=Gr0 and {circumflex over (x)}0=dec({tilde over (x)}0).
The ith iteration is given by:
ri=1m
{tilde over (x)}x=Gri
{circumflex over (x)}i=dec({tilde over (x)}i)
where 0m is defined as a diagonal matrix with value 1 on its mth diagonal term and 0 otherwise, and 1m as a diagonal matrix with value 0 on its mth diagonal term and 1 otherwise.
In [1], the filter used in the iterative detection algorithm is based on the least squares criteria, also known as zero forcing (ZF) filter. Improvement is marginal even when a filter based on standard minimum mean squared error (MMSE) is used.
An object of the invention is to increase the performance of existing detecting methods.
The object is achieved by a method for detecting a signal, a detector and a computer program product with the features according to the independent claims.
A method for detecting a signal received via a communication channel is provided, wherein the communication channel is affected by noise, wherein the received signal is processed according to a filtering step, the filtering step comprises multiplication of at least one component of the received signal with a filter coefficient and the filter coefficient comprises a noise variance offset which corresponds to the variance of the noise.
Further, a detector and a computer program product according to the method for detecting a signal described above are provided.
Illustratively, a filter is used for reconstructing the received signal which has the noise variance of the channel as additional input and which processes the received signal in dependence of the magnitude of the variance of the noise that affects the channel. At least one filter coefficients of the filter is modified by an offset made up by the noise variance. This means that at least one filter coefficient is a term that comprises the noise variance as summand.
Especially in cases of high SNR (signal to noise ratio), using the invention, a performance gain in terms of BER (bit error rate) with respect to prior art methods can be achieved.
Embodiments of the invention arise form the dependent claims. Embodiments of the invention which are described in the context of the method for detecting a signal are analogously valid for the detector and the computer program product.
In one embodiment, the received signal is grouped into a plurality of blocks.
The processing of the received signal according to the filtering step may corresponds to the multiplication of a block of the received signal with a filtering matrix.
The filtering matrix may correspond to a product of matrices, wherein one of the matrices is a channel coefficient matrix that comprises components which are terms of channel coefficients that specify the transmission characteristics of the channel.
A channel coefficient is typically denoted by h and specifies the impulse responses of the channel, for example in the frequency domain.
In one embodiment, at least one of the components of the channel coefficient matrix is a term of a channel coefficient and the variance of the noise. In another embodiment, a plurality of the components of the channel coefficient matrix are terms of a channel coefficient and the variance of the noise.
For example, at least one of the components of the channel coefficient matrix is the conjugate of a channel coefficient divided by the sum of the square of the absolute value of the channel coefficient and the noise variance.
At least one of the components of the channel coefficient matrix can be the inverse of a channel coefficient.
In one embodiment, the variance of the noise of the channel is determined.
The invention can for example be used in communication systems according to WLAN 11a, WLAN 11g, WLAN 11n, Super 3G, HIPERLAN 2 and WIMAX (Worldwide Interoperability for Microwave Access) and B3G (beyond 3G).
The transmitter/receiver system 100 is formed according to a PT-OFDM (Pre-Transform Orthogonal Frequency Division Multiplexing) system. For simplicity it is assumed that M=2k, e.g. M=32, and that M information symbols xm, m=1, 2, . . . , M are transmitted at the same time in form of one OFDM symbol. For transmitting these information symbols, the vector of information symbols, x=[x1, x2, . . . , xm]T, in the following also called the original signal vector, is fed to a pre-transform unit 101. The superscript T denotes the transpose operator.
The pre-transform unit 101 calculates a vector of modulation symbols s=[s1, s2, . . . , sM]T for the original signal vector according to
s=W·x.
W represents a PT (pre-transform) matrix of size M×M. There is no loss of code rate in terms of number of information symbols transmitted per channel use. In the case of an OFDM system, the matrix W would simply be an identity matrix.
The vector (or block) of modulation symbols s generated by the pre-transform unit 101 is then passed to an IFFT (inverse fast Fourier transform) unit 102 which carries out an inverse fast Fourier transform on the block of modulation symbols.
The inverse fast Fourier transform is used in this embodiment as an efficient realization of an inverse Fourier transform. Other domain transformations can be used instead of the inverse fast Fourier transform, for example an inverse discrete sine transform or an inverse discrete cosine transform.
The vector generated by the IFFT unit 102 is then mapped from parallel to serial, i.e. to a sequence of signal values, by a P/S (parallel to serial) unit 103. A cyclic prefix unit 104 inserts a cyclic prefix into the sequence of signal values to form a PT-OFDM symbol which is transmitted via a channel 105.
The cyclic prefix that is inserted has a duration no shorter than the maximum channel delay spread. The channel 105 is assumed to be a quasi/static frequency selective Rayleigh fading channel corrupted by additive white Gaussian noise (AWGN).
The pre-transform unit 101, the P/S unit 102 and the cyclic prefix unit 104 are part of a transmitter 106.
The PT-OFDM symbol is received by a receiver 107. A cyclic prefix removal unit 108 removes the cyclic prefix from the PT-OFDM symbol. The resulting sequence of signal values is mapped from parallel to serial by a S/P unit 109 and is domain transformed according to a fast Fourier transform by an FFT (fast Fourier transform) unit 110. Analogously to the IFFT unit 102, the FFT unit 110 can in other embodiments also be adapted to perform a discrete sine transform or a discrete cosine transform or another domain transformation.
The output vector of the FFT unit 110 is denoted by r=[r1, r2, . . . , rm]T and can be written as
r=Γ·s+n=Γ·W·x+n
where Γ=diag(h1, h2, . . . , hM) is a diagonal matrix with diagonal elements h1, . . . , hM which are the frequency domain channel coefficients and n is the AWGN vector of dimension M×1. The frequency domain channel coefficients are given by hm=Σn{tilde over (h)}n exp(−j2πn(m−1)/M), m=1, 2, . . . , M, assuming a sampled spaced Lth order FIR (finite input response) channel model {{tilde over (h)}n}n=0L.
The output vector r of the FFT unit 110 is fed to a detection unit 111. The detection unit 111 performs an iterative detection algorithm. An iteration (corresponding to an iteration index i) of the iterative detection algorithm corresponds to three stages, a reconstruction step, a linear filtering step and a decision step.
In the ith reconstruction step, i.e. in the reconstruction step of the iteration corresponding to the iteration index i, the mith component of the vector r is estimated. This is done by using the previously detected symbol {circumflex over (x)}x−1 (i.e. the signal vector detected in the previous iteration). mi corresponds to the frequency domain channel with the ith smallest amplitude. In the filtering step, the cross interference of the data is removed by a linear filter denoted by G. In the detection step, a tentative (hard or soft) decision (denoted by dec(.)) is made to generate the symbol detected in the ith iteration, {circumflex over (x)}i. When the last iteration has been performed (e.g. after a given number of iterations, e.g. 4, has been performed) the detected symbols {circumflex over (x)}i are output by decision units 112.
The algorithm is initialized with r0=r, {tilde over (x)}=Gr0 and {circumflex over (x)}0=dec({tilde over (x)}0).
The ith iteration is given by:
ri=1m
{tilde over (x)}i=Gri
{circumflex over (x)}i=dec({tilde over (x)}i)
where 0m is defined as a diagonal matrix with value 1 on its mth diagonal term and 0 otherwise, and 1m as a diagonal matrix with value 0 on its mth diagonal term and 1 otherwise.
Under the assumption that the variance of the noise corrupting the channel 105 is known, the MMSE (minimum mean square error) filter described in the following can be used by the detection unit 111 to improve the performance of the transmitter/receiver system 100.
Taking into account the MMSE criteria and assuming that previous detected symbols are correct for each reconstruction, the linear filter for the ith (i=1, 2, . . . , M) iteration can be derived:
and σ2 is the noise variance. This G is used in the filtering step of the reconstruction algorithm carried out by the detection unit 111 as described above.
For the initial iteration of the reconstruction algorithm, the MMSE filter with
βm=hm*/(|hm|2+σ2), m=1, . . . , M.
is used.
When the matrix W is chosen as unitary and has constant amplitude elements, even when the MMSE filter is used, the choice of mi is unchanged (corresponding to the frequency domain channel with the ith smallest amplitude). That is, this choice still maximizes the worse post-filtered SNR at every detection step under the assumption that the previous detection is correct.
Simulations show that using this filter, the error floor can be reduced and superior performance can be achieved for high SNR. Note that this MMSE filter requires the knowledge that the noise variance is known at the receiver. However, simulations show that it is robust to noise variance errors.
In one embodiment, the reconstruction is extended as will be described with reference to
The receiver 200 may be used instead of the receiver 107 shown in
Analogously to the detection unit 111, a vector r, e.g. the output vector of an FFT unit performing an FFT, is fed to the detection unit 201.
A filtering unit 202 of the receiver 201 performs a filtering step of a reconstruction algorithm, e.g. the initial filtering step of the reconstruction algorithm described above. The result of the filtering step, denoted by {tilde over (x)}0 in accordance to the above description of the reconstruction algorithm is supplied to a first nonlinear detection unit 203.
The receiver further comprises a second nonlinear detection algorithm unit 205. The structure of the first nonlinear detection unit 203 and the second nonlinear detection unit 205 are described in the following with reference to
The nonlinear detection unit performs an ordered interference cancellation algorithm as will be described in the following.
The input vector of the non-linear detection unit 300 is a soft estimate of a transmitted signal (in case of the first non-linear detection unit, this is the output {tilde over (x)}0 of the filtering unit 202). The input vector of the non-linear detection unit 300 is fed to an ordering unit 301.
The ordering unit 301 performs an ordering step by obtaining the minimum Euclidean distance of the input to any point of the signal constellation. Then, the components of the input vector are ordered from largest to smallest (minimal) Euclidean distance and a hard decision is performed on the components of the input vector to form c1, c2, . . . , cM.
c1, c2, . . . , cM are fed to a cancellation unit 302 which performs the following algorithm:
For interference cancellation j=1, . . . , J,
(i) use {ck}k≠j to cancel from reconstructed received signal ri to obtain a soft estimate of cj
(ii) perform hard decision on the soft estimate and update the newly detected cj
(iii) increment j and continue with (i)
J is the number of cancellation steps and is for example chosen equal to M.
Illustratively, the interference cancellation algorithm uses the “best” components of the estimate, in the sense that they have minimal Euclidean distance to the signal constellation to improve the “worse” components, which have a higher Euclidean distance to the signal constellation.
The output of the first cancellation unit 302 is fed to the reconstruction unit 204. The reconstruction unit 204 performs the reconstruction step and the filtering step for the ith iteration (where i=1, 2, . . . ) according to the reconstruction algorithm described above.
The result of each iteration performed by the reconstruction unit 204 is fed to the second non-linear detection unit 205. The output of the second non-linear detection unit 205 is fed back to the reconstruction unit 204 for the next iteration to be performed except for the last iteration, when the output is supplied to the decision units 206 which generate the output of the receiver 200.
The receiver 200 can also be used with a pre-transform (according to a matrix W) according to prior art and with a filter (according to a matrix G) according to prior art. This means that the idea of ordering the signal values according to a distance measure and using the signal values which are best (in terms of smallest distance) to cancel the interference from the other signal values is independent from using a pre-transformation matrix and from using a filter which is dependent on the variance of the noise of the channel used for data transmission.
In the above, the following documents are cited:
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/SG2005/000265 | 8/3/2005 | WO | 00 | 12/3/2008 |
| Publishing Document | Publishing Date | Country | Kind |
|---|---|---|---|
| WO2006/014142 | 2/9/2006 | WO | A |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4388724 | Göckler | Jun 1983 | A |
| 6301293 | Huang et al. | Oct 2001 | B1 |
| 6549544 | Kroeger et al. | Apr 2003 | B1 |
| 7315530 | Castelain et al. | Jan 2008 | B2 |
| 7336636 | Salzer | Feb 2008 | B2 |
| 20010007579 | Chouly | Jul 2001 | A1 |
| 20020191720 | Neubauer | Dec 2002 | A1 |
| 20030133404 | Castelain et al. | Jul 2003 | A1 |
| 20030137928 | Kroeger et al. | Jul 2003 | A1 |
| 20040062302 | Fujii et al. | Apr 2004 | A1 |
| 20040240587 | Ozen | Dec 2004 | A1 |
| Number | Date | Country |
|---|---|---|
| 0715407 | Feb 1992 | EP |
| 0580482 | Jul 1993 | EP |
| 0955727 | Apr 1999 | EP |
| 0525456 | Nov 2000 | EP |
| 10294711 | Apr 1997 | JP |
| 2000115028 | Apr 2000 | JP |
| 2004166218 | Jun 2004 | JP |
| WO0041338 | Dec 1999 | WO |
| WO0065792 | Nov 2000 | WO |
| WO2004032347 | Aug 2002 | WO |
| WO2004038984 | May 2004 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20090232261 A1 | Sep 2009 | US |
