US 7,751,506 B2Grant

Method for the soft bit metric calculation with linear MIMO detection for LDPC codes

Issue Date:2010-07-06

•33 Claims

•10 Drawing Sheets

Abstract

A MIMO receiver implements a method for the soft bit metric calculation with linear MIMO detection for LDPC codes, after linear matrix inversion MIMO detection. In the receiver, a detector detects the estimated symbol and the noise variance. Further, a soft metric calculation unit computes the distance between the estimated symbol and the constellation point, and then divides the distance by the noise variance to determine the soft bit metrics.

Metadata

Assignee

Samsung Electronics Co., Ltd.

Inventors

Huaning Niu
Chiu Ngo

Application Information

Application Number:US 11/292,853

Filing Date:2005-12-01

Priority Date:2005-12-01

Art Unit:2611

Classifications

IPC:

H03D1/00H04L27/06

Patent Drawings (10 sheets)

Description

Field of the Invention

[0001] The present invention relates to soft bit metric calculation with linear MIMO detection, and in particular to soft bit metric calculation with linear MIMO detection for LDPC codes.

Background of the Invention

[0002] Low-Density Parity-Check (LDPC) codes have recently attracted considerable attention owing to their capacity-approaching performance and low complexity iterative decoding. LDPC codes have been adopted in many standards such as DVB-S2 and IEEE802.16e. In addition, multiple-input multiple-output (MIMO) wireless systems have proven to be a solution to the high capacity requirement of many wireless systems. Accordingly, an LDPC coded MIMO-OFDM system is considered a strong candidate for the high throughput WLAN standard.

[0003] In a MIMO spatial multiplexing system, different data streams are transmitted in parallel, simultaneously. All transmitted streams experience different channel signatures, and are received overlapped at the receiver antennas. Therefore, the receiver must perform multi-signal detection. In terms of detection performance, the maximum likelihood bit metric detection is optimal. However, the computational complexity increases exponentially in relation to constellation size and the number of transmitter antennas. Therefore, suboptimal approaches are usually needed which first detect a symbol using a linear detector, followed by a soft posterior probability (APP) processing.

[0004] For example, in a MIMO system with Nt transmitter antennas and Nr receiver antennas, a received signal y can be represented as y=Hx+n, where y is Nrx1 received symbol vector, H is an NrxNt channel matrix, x is the Ntx1 transmitted signal vector, and n is a Nrx1 noise vector. As shown in FIG. 1, the transmitted signal can be estimated as {circumflex over (x)}=Wy=WHx+Wn using a MIMO Detector 12 in a receiver 10, where W is the pseudo-inverse of the channel matrix H. Then, the soft bit metrics used in outer error correction coding can be calculated from the estimated symbol {circumflex over (x)} in a soft metric calculation unit 14 to be used by a decoding unit 16.

[0005] The bit metrics can be calculated by finding the distance between {circumflex over (x)}_kand the constellation point as the single input single output (SISO) case via the log-likelihood ratio (LLR) as in relation (1) below:

[0006]

\begin{matrix} \begin{matrix} {LLR}_{ji} = (m_{ji}^{1} - m_{ji}^{0}) / σ_{n}^{2} \\ = (\min_{a \in C_{i}^{1}} { {\hat{x}}_{j} - a }^{2} - \min_{a \in C_{i}^{0}} { {\hat{x}}_{j} - a }^{2}) / σ_{n}^{2} \end{matrix} & (1) \end{matrix}

[0007] where {circumflex over (x)}_kis the estimated symbol at time index k, C_i^prepresents the subset of the constellation point such that bit i is equal to p, a presents a particular constellation point in the subset C_i^p, m_ki^pis the minimum distance between {circumflex over (x)}_kand the constellation points in C_i^p, pε{0,1}, and σ_n²represents the noise variance. For conventional convolutional decoding, the noise variance σ_n²can be normalized to 1, therefore, omitted in the following example without loss of generality.

[0008] FIG. 2 shows an example with QPSK modulation. FIG. 2 shows an example of calculating (1) using QPSK modulation. For Gray labeled QPSK constellation, there are 4 symbols: (1+j)/√{square root over (2)}, (−1+j)/√{square root over (2)}, (−1−j)/√{square root over (2)} and (1−j)/√{square root over (2)}, (j=√{square root over (−1)}), mapped with 2 bits (b1b0), correspondingly as 10, 00, 01, 11. With an estimated symbol at k-th time slot {circumflex over (x)}_k, which is a QPSK symbol, the soft bit information (b1 and b0) must be determined from {circumflex over (x)}_k. Taken b0 for example (left graph in FIG. 2), both constellation point (1+j)/√{square root over (2)} (labeled as 10) and (−1+j)/√{square root over (2)} (labeled as 00) have b0 equals 0, i.e., C_i⁰={(1+j)/√{square root over (2)},(−1+j)/√{square root over (2)}}. As such, for b0=0, the minimum distance of {circumflex over (x)}_kto (1+j)/√{square root over (2)} and (−1+j)/√{square root over (2)} must be found. In this case, the minimum distance

[0009]

\min_{a \in C_{i}^{0}} { {\hat{x}}_{k} - a }^{2}

is the distance between {circumflex over (x)}_kand (−1+j)/√{square root over (2)}. Similarly for b0=1,

[0010]

\min_{a \in C_{i}^{1}} { {\hat{x}}_{k} - a }^{2}

can be obtained, which is the minimum distance between {circumflex over (x)}_kand (−1−j)/√{square root over (2)}. The soft metric for b0 therefore equals to LLR_ki=m_ki¹−m_ki⁰for i=0. The right graph in FIG. 2 shows the case for b1. Both the constellation point (−1+j)/√{square root over (2)} (labeled as 00) and (−1−j)/√{square root over (2)} (labeled as 01) have b1=0. As such,

[0011]

m_{ki}^{0} = \min_{a \in C_{i}^{0}} { {\hat{x}}_{k} - a }^{2}

is the distance between {circumflex over (x)}_kand (−1+j)/√{square root over (2)}. Similarly, for

[0012]

b 1 = 1, m_{ki}^{1} = \min_{a \in C_{i}^{1}} { {\hat{x}}_{k} - a }^{2}

is the distance between {circumflex over (x)}_kand (1+j)/√{square root over (2)}. LLR_ki=m_ki¹−m_ki⁰, i=1 is the distance.

[0013] For convolutional codes, only the trellis difference instead of the absolute metric values is needed when applying Viterbi decoding. However, for LDPC codes where the exact message-passing decoding algorithm is applied, the exact metric is required. Scaling the soft metric causes performance degradation, therefore losing the coding gain of LDPC over convolutional codes. As such, there is a need for a method of calculating the soft metric for LDPC codes.

Brief Summary of the Invention

[0014] In one embodiment, the present invention provides a telecommunications receiver comprising a detector that detects data symbols in the received signal by applying a linear detector following either zero forcing (ZF) or minimum mean squared error (MMSE) criterion and determines the channel noise variance, a metric calculator that calculates the soft bit metrics from the detected symbols, as a function of the distance and the noise variance, and a decoder that performs LDPC decoding of the received signals using the soft bit metrics.

[0015] The decoder performs LDPC decoding using the soft bit metrics to determine data values in the received signals. The metric calculator calculates the soft bit metrics by dividing the distance by the noise variance. In one case, the detector determines the data symbols and the corresponding noise variance by performing MMSE criterion MIMO detection. In another case, the detector determines the data symbols and the corresponding noise variance by performing ZF criterion MIMO detection. Further, the metric calculator calculates the soft bit metrics by selecting the diagonal elements σ_v²of the noise variance matrix E[vv^H], and calculating the soft bit metrics as a function of the distance and σ_v².

[0016] These and other features, aspects and advantages of the present invention will become understood with reference to the following description, appended claims and accompanying figures.

Brief Description of the Drawings

[0017] FIG. 1 shows a block diagram of a conventional receiver structure for soft decoding with a linear MIMO detector;

[0018] FIG. 2 shows an example distance computation using QPSK;

[0019] FIG. 3 shows an example block diagram on embodiment of a MIMO receiver according to an embodiment of the present invention;

[0020] FIG. 4 shows performance example of an LDPC coded 2×2 MIMO-OFDM system according to the present invention over B-NLOS channel;

[0021] FIG. 5 shows performance of an example LDPC coded 2×2 MIMO-OFDM system according to the present invention over D-NLOS channel;

[0022] FIG. 6 shows performance of an example LDPC coded 2×2 MIMO-OFDM system according to the present invention over E-NLOS channel;

[0023] FIG. 7 shows performance comparison of an example soft metric calculation according to the present invention over the prior art in an example 2×2 MIMO-OFDM system with D-NLOS channel;

[0024] FIG. 8 shows an example flowchart of the steps of noise variance determination using MMSE criterion according to an embodiment of the present invention; and

[0025] FIG. 9 shows an example flowchart of the steps of noise variance determination using ZF criterion according to an embodiment of the present invention.

Detailed Description of the Invention

[0026] In one embodiment, the present invention provides an improved soft metric calculation for LDPC codes in a receiver after linear matrix inversion MIMO detection. Referring to the example block diagram in FIG. 3, an example MIMO receiver 30 implements a method for the soft bit metric calculation with linear MIMO detection for LDPC codes, according to an embodiment of the present invention. The example MIMO receiver 30 includes multiple antenna 31, a MIMO detector 32, a soft metric calculation unit 34 and a LDPC decoding unit 36.

[0027] The MIMO detector 32 detects the estimated symbol {circumflex over (x)} and the noise variance. The soft metric calculation unit 34 first computes the distance between {circumflex over (x)} and the constellation point by known methods, and then divides the distance by the noise variance calculated by the MIMO detector. Initially, the noise comprises white additive noise with variance σ_n². After the linear MIMO detector 32, the noise includes the rotated white noise and the cross talk between different data streams. If the MIMO channel is ill-conditioned, the noise will be very large. Therefore, accurate noise variance determination is important in maintaining the LDPC decoding performance.

[0028] The noise variance determination by the linear MIMO detector 32, with both MMSE criterion and ZF criterion, is now described. Considering a MIMO transmission y=Hx+n over a channel defined by a matrix H, the linear MIMO detector 32 applies a linear filter W to the received symbols y, such that:
{circumflex over (x)}=Wy=WHx+Wn,

[0029] where W=(H^HH+σ_n²I)⁻¹H^Hwith MMSE criterion, and W=(H^HH)⁻¹H^Hwith ZF criterion, wherein I is identity matrix H^His the pseudo-inverse of H and {circumflex over (x)} is the detected signal (estimated symbol).

[0030] Initially, the noise vector n comprises white noise with noise variance matrix σ_n²I. After a linear detection operation in the MIMO detector 32, the new noise term v contains the rotated noise, Wn, and the cross talk, (WH−diag(WH))x, between different data streams, wherein:
v=(WH−diag(WH))x+Wn.

[0031] The new noise v is colored noise wherein the variance matrix is no longer a diagonal matrix. Whitening the colored noise v requires complicated computations, such as the maximum likelihood detection or advanced beamforming.

[0032] Generally, the performance degradation due to the colored noise is around 3-5 dB over the 11n channel models. However, considering only the diagonal part of the noise variance matrix for each data stream greatly simplifies the system design, such that the diagonal noise variance matrix σ_v²is defined as:

[0033]

\begin{matrix} σ_{v}^{2} = E [diag {{vv}^{H}}] \\ = diag {(WH - diag (WH)) {R_{x} (WH - diag (WH))}^{H} + σ_{n}^{2} {WW}^{H}} \\ = diag {\begin{matrix} {WHR}_{x} H^{H} W^{H} - diag {WH} R_{x} H^{H} W^{H} - \\ {WHR}_{x} diag {WH} + diag {WH} R_{x} diag {WH} + σ_{n}^{2} {WW}^{H} \end{matrix}} \end{matrix}

[0034] where v^His the pseudo-inverse of v and W^His the pseudo inverse of W.

[0035] Because R_x, is identical matrix which means that the input signals x are independent, using linear algebra:

[0036]

\begin{matrix} \begin{matrix} σ_{v}^{2} = E [diag {{vv}^{H}}] \\ = diag {{WHH}^{H} W^{H}} - {diag}^{2} {WH} + diag {σ_{n}^{2} {WW}^{H}} \end{matrix} & (2) \end{matrix}

[0037] The noise variance can be further simplified for both a MMSE MIMO detector and a ZF MIMO detector.

[0038] For a MIMO detector utilizing an MMSE estimator, based on orthogonality principles:

[0039]

\begin{matrix} \begin{matrix} (\hat{x} - x) ⊥ y \Rightarrow E [{y (\hat{x} - x)}^{H}] = 0 \\ \Rightarrow E [{yy}^{H} W] = 0 \\ \Rightarrow (H^{H} H + σ_{n}^{2} I) W = H^{H} \\ \Rightarrow W^{H} (H^{H} H + σ_{n}^{2} I) W = W^{H} H^{H} \\ \Rightarrow W^{H} H^{H} - W^{H} (H^{H} H) W = σ_{n}^{2} W^{H} W^{H} \end{matrix} & (3) \end{matrix}

[0040] Plugging relation (3) into relation (2) above, the diagonal matrix σ_v²is defined as:

[0041]

\begin{matrix} \begin{matrix} σ_{n}^{2} = E [diag {{vv}^{H}}] \\ = diag {{WHH}^{H} W^{H}} - {diag}^{2} {WH} + \\ diag {W^{H} H^{H} - W^{H} (H^{H} H) W} \\ = diag {W^{H} H^{H}} - {diag}^{2} {WH} \end{matrix} & (4) \end{matrix}

[0042] For a MIMO detector 32 utilizing a ZF estimator:
WH=(H^HH)⁻¹H^HH=I,

[0043] whereby the diagonal matrix σ_v²is defined as:
σ_v²=E[diag{vv^H}]
=σ_n²diag{WW^H}

[0044] Finally, the soft metric for each data stream is calculated in the soft metric calculation unit 34 as: distance/σ_v². This provides exact metric for LDPC codes with improved detection performance.

[0045] Performance examples (signal-to-noise ratio (SNR) v. PER (packet error rate) for a 2×2 MMSE MIMO detector 32 using IEEE802.11n channels BNLOS, DNLOS, ENLOS with different coding and modulation according to embodiments the present invention are shown by examples in FIGS. 4, 5 and 6, respectively. A size 2304 LDPC code is simulated with different modulation schemes and coding rates. In the legends for FIGS. 4-6, “16QAM ½” means that 16QAM modulation with rate ½ LDPC codes is used, “16QAM ¾” means that 16QAM modulation with rate ¾ LDPC codes is used, “64QAM ⅔” that 64QAM modulation with rate ⅔ LDPC codes is used, and so on. In general, the LDPC code performance according to the present invention is 2-3 dB better than convolutional codes.

[0046] FIG. 7 shows a comparison of performance of an embodiment of the soft metric calculation according to the present invention, in relation to that of a prior art methods, over a IEEE802.11n channel model D, for 16QAM ½ (701a present invention, 701b prior art) 16QAM ¾ (702a present invention, 702b prior art) and 64QAM ¾ (703a present invention, 703b prior art) rate codes. As FIG. 7 shows, significant performance improvement is observed over the prior art. The above derived soft metrics can also be used in convolutional codes. Prior art shows the performance with the noise variance is σ_n². The improved performance curves 701a, 702a and 703a are with noise variance σ_v²obtained according to the present invention.

[0047] FIG. 8 shows an example flowchart of the steps of noise variance determination using MMSE criterion discussed above, according to an embodiment of the present invention, including the steps of: receive the signal vector y (step 800), compute MIMO detection coefficient W from channel matrix based on MMSE criterion (step 802), compute detected symbol {circumflex over (x)} based on the received signals y and the MIMO detection coefficient W (step 804), compute the distance between {circumflex over (x)} and the constellation point based on the detected signal and the constellation map (step 806), compute the noise variance σ_v²(step 808), calculate the soft metric by dividing the distance with the noise variance (step 810), and perform LPDC decoding (step 812).

[0048] FIG. 9 shows an example flowchart of the steps of noise variance determination using ZF criterion discussed above, according to an embodiment of the present invention, including the steps of: receive the signal vector y (step 900), compute MIMO detection coefficient W from channel matrix based on ZF criterion (step 902), compute detected symbol {circumflex over (x)} based on the received signals y and the MIMO detection coefficient W (step 804), compute the distance between {circumflex over (x)} and the constellation point based on the detected signal and the constellation map (step 906), compute the noise variance σ_v²(step 908), calculate the soft metric by dividing the distance with the noise variance (step 910), and perform LPDC decoding (step 912).

[0049] The present invention has been described in considerable detail with reference to certain preferred versions thereof; however, other versions are possible. Therefore, the spirit and scope of the appended claims should not be limited to the description of the preferred versions contained herein.

Claims

What is claimed is:

1. A method of soft bit metric calculation for received data signals via a channel in a telecommunications receiver utilizing Low Density Parity Check (LDPC) decoding, comprising:

detecting data symbols in the received signals by applying a linear Multiple-Input Multiple-Output (MIMO) detection, wherein the linear MIMO detection comprises determining distances between the detected data symbols and constellation points;

determining a noise variance of the channel;

selecting diagonal elements of the channel noise variance matrix E[vv^H], and

calculating the soft bit metrics as a function of the distances and σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

W is a linear filter and W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of V.

2. The method of claim 1, further comprising:

LDPC decoding using the soft bit metrics to determine data values in the received signals.

3. The method of claim 1, wherein the determining the noise variance further includes performing minimum mean squared error (MMSE) criterion MIMO detection.

4. The method of claim 3 wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, the method further comprising applying a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH+σ_n²I)⁻¹H^Hwith MMSE criterion, where H^His a pseudo-inverse of H.

5. The method of claim 1 wherein the determining the noise variance further includes performing Zero Forcing (ZF) criterion MIMO detection.

6. The method of claim 5 wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, the method further comprising applying a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH)⁻¹H^Hwith ZF criterion and H^His a pseudo-inverse of H.

7. The method of claim 1, wherein the calculating the soft bit metrics further includes:

determining the new noise term v=(WH−diag(WH))x+Wn where filtering effect and cross-talk are considered,

selecting the diagonal elements σ_v²of the noise variance matrix E[vv^H],

calculating the soft bit metrics as a function of the distance and σ_v², where W is a linear filter, H is a NrxNt channel matrix in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, n represents a Nrx1 noise vector and v^His a pseudo-inverse of v.

8. The method of claim 7, wherein the determining the noise variance further includes performing Zero Forcing (ZF) criterion MIMO detection, wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, the method further comprising applying a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH)⁻¹H^Hwith ZF criterion,

such that for ZF estimation:

WH=(H^HH)⁻¹H^HH=I.

9. The method of claim 7 wherein the soft bit metric of a first received data stream is divided by a first diagonal element of the noise variance matrix, and the soft metric of a second received data stream is divided by a second diagonal element of the noise variance matrix.

10. The method of claim 1 wherein the receiver comprises a wireless MIMO receiver.

11. The method of claim 10 wherein the receiver receives multiple data streams signals from a transmitter with multiple antennas.

12. The method of claim 1 wherein:

the detecting data symbols further includes detecting the data symbols in the received signal using linear matrix inversion MIMO detection, and

the calculating the bit metrics further includes computing the bit metrics by determining distances between the detected data symbols and constellation points.

13. A telecommunications receiver, comprising:

a detector that detects data symbols in received signals by determining distances between received signal points and constellation points, and determines channel noise variance;

a metric calculator that calculates soft bit metrics for the received signals via a channel, as a function of the distances and the noise variance, wherein the distances are divided by the noise variance, wherein the metric calculator calculates the soft bit metrics by:

selecting diagonal elements σ_v²of the noise variance matrix E[vv^H],

calculating the soft bit metrics as a function of the distances and σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

W is a linear filter and W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v; and

a decoder that performs LDPC decoding of the received signals using the soft bit metrics.

14. The receiver of claim 13 wherein the decoder performs LDPC decoding using the soft bit metrics to determine data values in the received signals.

15. The receiver of claim 13 wherein the detector determines the noise variance by performing minimum mean squared error (MMSE) criterion MIMO detection.

16. The receiver of claim 15 wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, such that detector applies a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH+σ_n²I)⁻¹H^Hwith MMSE criterion and H^His a pseudo-inverse of H.

17. The receiver of claim 13 wherein the detector determines the noise variance by performing Zero Forcing (ZF) criterion MIMO detection.

18. The receiver of claim 17 wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, such that the detector applies a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH)⁻¹H^Hwith ZF criterion and H^His a pseudo-inverse of H.

19. The receiver of claim 13, wherein the detector determines the noise variance by performing Zero Forcing (ZF) criterion MIMO detection, wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, such that the detector applies a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH+σ_n²I)⁻¹H^Hwith ZF criterion and σ_n²represents the noise variance,

such that for ZF estimation:

WH=(H^HH)⁻¹H^HH=I.

20. The receiver of claim 13 wherein the soft bit metric of a first received data stream is divided by a first diagonal element of the noise variance matrix, and the soft metric of a second received data stream is divided by a second diagonal element of the noise variance matrix.

21. The receiver of claim 13 wherein the receiver comprises a wireless MIMO receiver.

22. The receiver of claim 21 wherein the receiver receives multiple data streams signals from a transmitter with multiple antennas.

23. The receiver of claim 13 wherein:

the detector detects the data symbols in the received signal using direct matrix inversion type linear MIMO detection, and

the metric calculator computes the bit metrics by determining distances between the detected data symbols and constellation points.

24. A wireless communication receiver, comprising:

a detector configured to detect symbols by determining distances between received signal points and constellation points, and to determine channel noise variance in a received data signal by applying a linear MIMO detection;

a metric calculator configured to select diagonal elements σ_v²of a noise variance matrix E[vv^H] and calculate soft bit metrics for the received data signal via a channel by selecting the diagonal elements σ_v²of the noise variance matrix E[vv^H] as a function of the distances and σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

W is a linear filter, W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v.

25. The wireless communication receiver of claim 24, wherein the soft bit metrics are calculated by dividing the distances by the noise variance.

26. The wireless communication receiver of claim 24, further comprising a decoder that performs LDPC decoding of the received data signal using the soft bit metrics.

27. The wireless receiver of claim 24, wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, such that detector applies the linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH+σ_n²I)⁻¹H^Hwith minimum mean squared error (MMSE) criterion and H^His a pseudo-inverse of H.

28. The wireless receiver of claim 24, wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector,

such that the detector applies a linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH)⁻¹H^Hwith Zero Forcing (ZF) criterion and H^His a pseudo-inverse of H.

29. A method of soft bit metric calculation for received data signals via a channel in a telecommunications receiver utilizing LDPC decoding, comprising:

detecting data symbols in the received signals by applying a linear MIMO detection, wherein the linear MIMO detection comprises determining distances between the detected data symbols and constellation points;

determining a noise variance of the channel;

calculating the soft bit metrics as a function of the distances between the detected data symbols and the constellation points, and calculating a channel noise variance matrix E[vv^H], wherein the distances are divided by the noise variance, said calculating further includes selecting the diagonal elements σ_v²of the noise variance matrix E[vv^H] as a function of the distances and σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

where W is a linear filter, W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v,

wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, the method further comprising applying the linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH+σ_n²I)⁻¹H^Hwith MMSE criterion, where H^His a pseudo-inverse of H.

30. A telecommunications receiver, comprising:

a detector that detects data symbols in received signals by determining distances between received signal points and constellation points, and determines noise variance of a channel;

a metric calculator that calculates soft bit metrics for the received signals via the channel, as a function of the distances and the noise variance, wherein the distances are divided by the noise variance, said calculator further selects the diagonal elements σ_v²of a noise variance matrix E[vv^H] as a function of the distances and σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

where W is a linear filter, W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v; and

a decoder that performs LDPC decoding of the received signals using the soft bit metrics, wherein the channel is defined by a NrxNt channel matrix H in a MIMO system having a receiver with Nt transmitter antennas and Nr receiver antennas, x is the Ntx1 transmitted signal vector, the received symbol is represented by a Nrx1 received symbol vector y=Hx+n, n represents a Nrx1 noise vector, such that the detector applies the linear filter W to the received symbols y to compute estimated symbols {circumflex over (x)} as:

{circumflex over (x)}=Wy=WHx+Wn,

where W=(H^HH+σ_n²I)⁻¹H^Hwith MMSE criterion and H^His a pseudo-inverse of H.

31. A method of soft bit metric calculation for received signals via a channel in a telecommunications receiver utilizing LDPC decoding, comprising:

determining a noise variance of the channel;

selecting diagonal elements σ_v²of the channel noise variance matrix E[vv^H] and

calculating the soft bit metrics as a function of the distances and the diagonal elements σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

W is a linear filter, W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v.

32. A telecommunications receiver, comprising:

a detector that detects data symbols in signals received via a channel by determining distances between received signal points and constellation points, and determines noise variance of the channel;

a metric calculator that calculates soft bit metrics for the received signals, as a function of the distances and the noise variance, wherein the distances are divided by the noise variance, wherein the metric calculator calculates the soft bit metrics by:

selecting the diagonal elements σ_v²of a channel noise variance matrix E[vv^H],

calculating the soft bit metrics as a function of the distances and the diagonal elements σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

W is a linear filter, W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v; and

a decoder that performs LDPC decoding of the received signals using the soft bit metrics.

33. A wireless communication receiver, comprising:

a detector configured for detecting symbols by determining distances between received signal points and constellation points, and for determining channel noise variance in a received data signal by applying a linear MIMO detection;

a metric calculator configured for selecting diagonal elements σ_v²of a noise variance matrix E[vv^H] and for calculating soft bit metrics for the received data signal via a channel by selecting the diagonal elements σ_v²of the noise variance matrix E[vv^H], and calculating the soft bit metrics as a function of the distances and the diagonal elements σ_v², where the diagonal elements σ_v²is defined as:

σ_v²=E[diag{vv^H}]

=σ_n²diag{WW^H},

W is a linear filter, W^His a pseudo-inverse of W, σ_n²represents the noise variance and v is a new noise term and v^His a pseudo-inverse of v.

Patent Citations (40)

Patent	Date	Inventor	Cited By
US6421553(B1)	2002-07-01	Costa et al.	Applicant
US6629041(B1)	2003-09-01	Marbach	Applicant
US7130461(B2)	2006-10-01	Rosenholtz	Applicant
US7177446(B2)	2007-02-01	Magarey	Applicant
US7197690(B2)	2007-03-01	Shen et al.	Applicant
US7231007(B2)	2007-06-01	Artamo et al.	Applicant
US7236554(B2)	2007-06-01	Gupta	Applicant
US7298772(B1)	2007-11-01	Neerudu et al.	Applicant
US7308026(B2)	2007-12-01	Purho	Applicant
US7313172(B2)	2007-12-01	Pan et al.	Applicant
US7313750(B1)	2007-12-01	Feng et al.	Examiner
US7315566(B2)	2008-01-01	Tanno et al.	Applicant
US7315576(B1)	2008-01-01	van Nee et al.	Examiner
US7352909(B2)	2008-04-01	Guleryuz	Applicant
US7382827(B2)	2008-06-01	Yousef et al.	Applicant
US7386058(B2)	2008-06-01	Fujii	Applicant
US7397826(B2)	2008-07-01	Gorokhov	Examiner
US7415059(B2)	2008-08-01	Chadha et al.	Applicant
US7447277(B2)	2008-11-01	Yajima et al.	Applicant
US7480234(B1)	2009-01-01	Hart et al.	Applicant
US2003/0063654(A1)	2003-04-01	Onggosanusi et al.	Examiner
US2004/0005022(A1)	2004-01-01	Zhu et al.	Applicant
US2004/0076248(A1)	2004-04-01	Purho	Examiner
US2004/0203456(A1)	2004-10-01	Onggosanusi et al.	Examiner
US2004/0223480(A1)	2004-11-01	Nguyen et al.	Examiner
US2005/0220175(A1)	2005-10-01	Zhou	Applicant
US2005/0265467(A1)	2005-12-01	Dabak et al.	Applicant
US2006/0018410(A1)	2006-01-01	Onggosanusi et al.	Examiner
US2006/0062283(A1)	2006-03-01	Zhang et al.	Applicant
US2006/0092902(A1)	2006-05-01	Schmidt	Applicant
US2006/0105767(A1)	2006-05-01	Kim	Applicant
US2006/0146962(A1)	2006-07-01	Troya et al.	Applicant
US2006/0222095(A1)	2006-10-01	Niu et al.	Applicant
US2006/0227903(A1)	2006-10-01	Niu et al.	Applicant
US2007/0005749(A1)	2007-01-01	Sampath	Examiner
US2007/0041478(A1)	2007-02-01	Kolze	Examiner
US2007/0092110(A1)	2007-04-01	Xu et al.	Applicant
US2007/0127603(A1)	2007-06-01	Niu et al.	Applicant
US2008/0285685(A1)	2008-11-01	Chang et al.	Examiner
US2009/0154599(A1)	2009-06-01	Siti et al.	Examiner

Non-Patent Literature (17)

T.M. Schmidl and D.C. Cox, “Robust frequency and timing synchronization for OFDM,” IEEE Transactions on Communications, Dec. 1997, pp. 1613-1621, vol. 45, No. 12.Applicant
H. Minn, M. Zeng and V.K. Bhargava, “On timing offset estimation for OFDM systems,” IEEE Communications Letters, Jul. 2000, pp. 242-244, vol. 4, No. 7.Applicant
J. Li, G. Liu and G.B. Giannakis, “Carrier frequency offset estimation for OFDM-Based WLANs” IEEE Signal Processing Letters, Mar. 2001, pp. 80-82, vol. 8, No. 3.Applicant
Byungjoon Park, et al. “A Novel Timing Estimation Method for OFDM Systems” IEEE Communications Letters, vol. 7, No. 5, May 2003, pp. 239-241.Applicant
U.S. Non-Final Office Action for U.S. Appl. No. 11/100,239 mailed Dec. 10, 2007.Applicant
U.S. Non-Final Office Action for U.S. Appl. No. 11/100,239 mailed Jun. 13, 2008.Applicant
U.S. Non-Final Office Action for U.S. Appl. No. 11/100,239 mailed Oct. 30, 2008.Applicant
U.S. Non-Final Office Action for U.S. Appl. No. 11/104,722 mailed Jan. 22, 2008.Applicant
U.S. Non-Final Office Action for U.S. Appl. No. 11/104,722 mailed Jul. 31, 2008.Applicant
U.S. Final Office Action for U.S. Appl. No. 11/104,722 mailed Jan. 6, 2009.Applicant
Office Communication, Notice of Alowance for U.S. Appl. No. 11/100,239 mailed Mar. 6, 2009.Applicant
Office Communication, Examiner's Interview Summary for U.S. Appl. No. 11/104,722 mailed May 12, 2009.Applicant
U.S. Notice of Allowance for U.S. Appl. No. 11/100,239 mailed Sep. 3, 2009.Applicant
U.S. Advisory Action for U.S. Appl. No. 11/104,722 mailed Apr. 8, 2009.Applicant
U.S. Appl. No. 11/104,722, filed Apr. 12, 2005, H. Niu et al.Applicant
G. D. Golden, C. J. Foschini, R. A. Valenzuela and P. W. Wolniansky, Detection Algorithm and Initial Laboratory Results Using V-BLAST Space-Time Communication Architecture, Electronics Letters, Jan. 1999, pp. 14-16, vol. 35, No. 1.Applicant
E. Zehavi, 8-PSK trellis codes for a Rayleigh channel, IEEE Transactions on Communications, May 1992, pp. 873-884, vol. 40, No. 5.Applicant

Abstract

Description

Field of the Invention

[0001] The present invention relates to soft bit metric calculation with linear MIMO detection, and in particular to soft bit metric calculation with linear MIMO detection for LDPC codes.

Background of the Invention

[0006]

\begin{matrix} \begin{matrix} {LLR}_{ji} = (m_{ji}^{1} - m_{ji}^{0}) / σ_{n}^{2} \\ = (\min_{a \in C_{i}^{1}} { {\hat{x}}_{j} - a }^{2} - \min_{a \in C_{i}^{0}} { {\hat{x}}_{j} - a }^{2}) / σ_{n}^{2} \end{matrix} & (1) \end{matrix}

[0009]

\min_{a \in C_{i}^{0}} { {\hat{x}}_{k} - a }^{2}

is the distance between {circumflex over (x)}_kand (−1+j)/√{square root over (2)}. Similarly for b0=1,

[0010]

\min_{a \in C_{i}^{1}} { {\hat{x}}_{k} - a }^{2}

[0011]

m_{ki}^{0} = \min_{a \in C_{i}^{0}} { {\hat{x}}_{k} - a }^{2}

is the distance between {circumflex over (x)}_kand (−1+j)/√{square root over (2)}. Similarly, for

[0012]

b 1 = 1, m_{ki}^{1} = \min_{a \in C_{i}^{1}} { {\hat{x}}_{k} - a }^{2}