# US 2017/0288912 A1 · Method and apparatus for soft detection of high order qam symbols in mimo channels

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0288912 A1
- Document ID: US20170288912A1
- Status: Published application
- Kind: A1
- Application number: 15/630,459
- Filed: 2017-06-22
- Published: 2017-10-05
- Earliest claimed: 2015-04-24
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Mojtaba RAHMATI; Dongwoon BAI; Jungwon LEE
- Web page: https://patentgrep.com/patent/US20170288912A1

## CPC

- H04L 25/0256: {Channel estimation using minimum mean square error criteria}
- H04B 7/0413: MIMO systems
- H04L 1/0054: {Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms}
- H04L 25/03305: {Joint sequence estimation and interference removal (joint detection of several desired signals H04L25/03331)}
- H04L 25/067: {providing soft decisions, i.e. decisions together with an estimate of reliability (H04L25/068 and H04L25/069 take precedence; sequence estimation techniques H04L25/03178)}
- H04L 27/38: Demodulator circuits; Receiver circuits
- H04L 1/0048: {in conjunction with detection of multiuser or interfering signals, e.g. iteration between CDMA or MIMO detector and FEC decoder (for spatial equalizer H04L25/03286)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

Methods and apparatus for soft MIMO detection of high order QAM with initial candidate reduction are described. A method includes receiving a plurality of signals including Q-order quadrature amplitude modulation (QAM) symbols; determining, based on linear minimum mean square error (MMSE) estimation using detection of I and Q signs around a target layer, a reduced candidate set including C potential candidates, where C is less than Q; calculating Euclidean distances (EDs) based on the reduced candidate set; and generating log-likelihood ratio (LLR) information based on the calculated EDs.

## Claims

### Claim 1

A method comprising:
receiving a plurality of signals including Q-order quadrature amplitude modulation (QAM) symbols;
determining, based on linear minimum mean square error (MMSE) estimation using detection of I and Q signs around a target layer, a reduced candidate set including C potential candidates, where C is less than Q;
calculating Euclidean distances (EDs) based on the reduced candidate set; and
generating log-likelihood ratio (LLR) information based on the calculated EDs.

### Claim 2 (depends on 1)

The method of claim 1, further comprising providing the generated LLR information to a decoder.

### Claim 3 (depends on 1)

The method of claim 1, wherein Q is 256 and C is 128.

### Claim 4 (depends on 1)

The method of claim 1, wherein determining the reduced candidate set comprises:
estimating a linear MMSE; and
selecting the reduced candidate set based on the estimated linear MMSE.

### Claim 5 (depends on 4)

The method of claim 4, wherein the linear MMSE is estimated using:
x
^
0
=

1
ch
pow

(
(

h
1

2
+
σ
2
)

h
0
H

y
-
h
0
H

h
1

h
1
H

y
)
=

(
(

h
1

2
+
σ
2
)


h
0

2
-

h
0
H

h
1

2
)

x
0
+
σ
2


h
0
H

h
1

2

x
1
+
n
′
ch
pow
where {circumflex over (x)}0 represents an initial MMSE estimation, y=[y0, . . . , yr-1]T is an nR×1 receive signal vector, x=[x0, x1]T is a 2×1 transmit signal vector, H=[h0, h1] is an nR×2 channel coefficient matrix, hi=[hi,0, . . . , hi,nR-1]T, hi,j represents a channel between i-th transmit and j-th receive antennas, n is an additive white Gaussian noise vector with covariance E{nnH}=σ2 I, chpow=(|h1|2+σ2)(|h0|2+σ2) −h0Hh1|2, and n′=(|h1|2+σ2)h0H n −h0Hh1h1Hn.

### Claim 6 (depends on 5)

The method of claim 5, wherein the LLR information is generated using:
L
A

(
b
0
,
l
)
≈
log

max
x
0
∈
X
128

(
x
^
0
)
&

b
0
,
l
=
0

max
x
1


e
-

y
-
Hx

2
σ
2

Π
(
m
,
n
)
≠
(
i
,
l
)

P

(
b
m
,
n
)
max
x
0
∈
X
128

(
x
^
0
)
&

b
0
,
l
=
1

max
x
1


e
-

y
-
Hx

2
σ
2

Π
(
m
,
n
)
≠
(
i
,
l
)

P

(
b
m
,
n
)
+
L
a

(
b
0
,
l
)
where b0,l represents an 1-th bit of symbol x0, LA(b0,l) is a posteriori LLR of b0,l, and X128({circumflex over (x)}0) is a set of 128 initial candidates selected using the initial MMSE estimation {circumflex over (x)}0.

### Claim 7 (depends on 1)

The method of claim 1, wherein determining the reduced candidate set comprises:
receiving prior information;
determining a linear MMSE soft interference cancellation (MMSE-SIC); and
selecting the reduced candidate set based on the determined linear MMSE-SIC.

### Claim 8 (depends on 7)

The method of claim 7, wherein the prior information includes at least one of self-prior information and cross-prior information.

### Claim 9 (depends on 7)

The method of claim 7, wherein the linear MMSE-SIC is determined using:
x
^
0
=

1
ch
pow

(
(
λ
1
2


h
1

2
+
σ
2
)

λ
0
2

h
0
H

y
-
λ
0
2

λ
1
2

h
0
H

h
1

h
1
H

y
-
σ
2

λ
0
2

h
0
H

h
1

μ
1
-

(
(
λ
1
2


h
1

2
+
σ
2
)

λ
0
2


h
0

2
-
λ
0
2

λ
1
2


h
0
H

h
1

2
)

μ
0
)
+
μ
0
=

1
ch
pow

(
(
λ
1
2


h
1

2
+
σ
2
)

λ
0
2

h
0
H

y
-
λ
0
2

λ
1
2

h
0
H

h
1

h
1
H

y
-

σ
2

λ
0
2

h
0
H

h
1

μ
1
+
σ
2

(
λ
1
2


h
1

2
+
σ
2
)

μ
0
)
where y=[y0, . . . , yr-1]T is an nR×1 receive signal vector, x=[x0, x1]T is a 2×1 transmit signal vector, H=[h0, h1] is an nR×2 channel coefficient matrix, hi=[hi,0, . . . , hi,nR-1]T, hi,j represents a channel between i-th transmit and j-th receive antennas, chpow=(|h1|2+σ2)(|h0|2+σ2)−|h0Hh1|2, μi=E{xi}, and
E

{
[
x
0
-
μ
0
x
1
-
μ
1
]

[
x
0
*
-
μ
0
*
x
1
*
-
μ
1
*
]
}
=
[
λ
0
2
0
0
λ
1
2
]
.

### Claim 10 (depends on 1)

The method of claim 1, wherein determining the reduced candidate set comprises:
receiving prior information;
estimating an MMSE without using the prior information;
slicing over the estimated MMSE based on the received prior information; and
selecting the reduced candidate set based on the sliced estimated MMSE.

### Claim 11

An apparatus comprising:
a plurality of antennas; and
a multiple input multiple output (MIMO) detector that receives, via the plurality of antennas, a plurality of signals including Q-order quadrature amplitude modulation (QAM) symbols, determines, based on linear minimum mean square error (MMSE) estimation using detection of I and Q signs around a target layer, a reduced candidate set including C potential candidates, where C is less than Q, calculates Euclidean distances (EDs) based on the reduced candidate set, and generates log-likelihood ratio (LLR) information based on the calculated EDs.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein the MIMO detector provides the generated LLR information to a decoder.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein Q is 256 and C is 128.

### Claim 14 (depends on 11)

The apparatus of claim 11, wherein the MIMO detector determines the reduced candidate set by:
estimating a linear MMSE; and
selecting the reduced candidate set based on the estimated linear MMSE.

### Claim 15 (depends on 14)

The apparatus of claim 14, wherein the MIMO detector estimates the linear MMSE using:
x
^
0
=

1
ch
pow

(
(

h
1

2
+
σ
2
)

h
0
H

y
-
h
0
H

h
1

h
1
H

y
)
=

(
(

h
1

2
+
σ
2
)


h
0

2
-

h
0
H

h
1

2
)

x
0
+
σ
2


h
0
H

h
1

2

x
1
+
n
′
ch
pow
where {circumflex over (x)}0 represents an initial MMSE estimation, y=[y0, . . . , yr-1]T is an nR×1 receive signal vector, x=[x0, x1]T is a 2×1 transmit signal vector, H=[h0, h1] is an nR×2 channel coefficient matrix, hi=[hi,0, . . . , hi,nR-1]T, hi,j represents a channel between i-th transmit and j-th receive antennas, n is an additive white Gaussian noise vector with covariance E{nnH}=σ2I, chpow=(|h1|2+σ2)(|h0|+σ2)−|h0Hh1|2, and n′=(|h1|2+σ2)h0H n−h0Hh1h1Hn.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein the MIMO detector generates the LLR information using:
L
A

(
b
0
,
l
)
≈
log

max
x
0
∈
X
128

(
x
^
0
)
&

b
0
,
l
=
0

max
x
1

e
-

y
-
Hx

2
σ
2

∏
(
m
,
n
)
≠
(
i
,
l
)


P

(
b
m
,
n
)
max
x
0
∈
X
128

(
x
^
0
)
&

b
0
,
l
=
1

max
x
1

e
-

y
-
Hx

2
σ
2

∏
(
m
,
n
)
≠
(
i
,
l
)


P

(
b
m
,
n
)
+
L
a

(
b
0
,
l
)
where b0,l represents the 1-th bit of symbol x0, LA(b0,l) is a posteriori LLR of b0,l and X128({circumflex over (x)}0) is the set of 128 initial candidates selected using the initial MMSE estimation {circumflex over (x)}0.

### Claim 17 (depends on 11)

The apparatus of claim 11, wherein the MIMO detector determines the reduced candidate set by:
receiving prior information;
determining a linear MMSE soft interference cancellation (MMSE-SIC); and
selecting the reduced candidate set based on the determined linear MMSE-SIC.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein the prior information includes at least one of self-prior information and cross-prior information.

### Claim 19 (depends on 17)

The apparatus of claim 17, wherein the MIMO detector determines the linear MMSE-SIC using:
x
^
0
=

1
ch
pow

(
(
λ
1
2


h
1

2
+
σ
2
)

λ
0
2

h
0
H

y
-
λ
0
2

λ
1
2

h
0
H

h
1

h
1
H

y
-
σ
2

λ
0
2

h
0
H

h
1

μ
1
-

(
(
λ
1
2


h
1

2
+
σ
2
)

λ
0
2


h
0

2
-
λ
0
2

λ
1
2


h
0
H

h
1

2
)

μ
0
)
+
μ
0
=

1
ch
pow

(
(
λ
1
2


h
1

2
+
σ
2
)

λ
0
2

h
0
H

y
-
λ
0
2

λ
1
2

h
0
H

h
1

h
1
H

y
-

σ
2

λ
0
2

h
0
H

h
1

μ
1
+
σ
2

(
λ
1
2


h
1

2
+
σ
2
)

μ
0
)
where y=[y0, . . . , yr-1]T is an nR×1 receive signal vector, x=[x0, x1]T is a 2×1 transmit signal vector, H=[h0, h1] is an nR×2 channel coefficient matrix, hi=[hi,0, . . . , hi,nR-1]T, hi,j represents a channel between i-th transmit and j-th receive antennas, chpow=(|h1|2+σ2)(|h0|2+σ2)−|h0Hh1|2, μi=E{xi}, and
E

{
[
x
0
-
μ
0
x
1
-
μ
1
]

[
x
0
*
-
μ
0
*
x
1
*
-
μ
1
*
]
}
=
[
λ
0
2
0
0
λ
1
2
]
.

### Claim 20 (depends on 11)

The apparatus of claim 11, wherein the MIMO detector determines the reduced candidate set by:
receiving prior information;
estimating an MMSE without using the prior information;
slicing over the estimated MMSE based on the received prior information; and
selecting the reduced candidate set based on the sliced estimated MMSE.

### Claim 21

A system on chip comprising:
a MIMO detector that receives a plurality of signals including Q-order QAM symbols, determines, based on linear minimum mean square error (MMSE) estimation using detection of I and Q signs around a target layer, a reduced candidate set including C potential candidates, where C is less than Q, calculates Euclidean distances (EDs) based on the reduced candidate set, and generates log-likelihood ratio (LLR) information based on the calculated EDs; and
a decoder that decodes the signals using the LLR information.
