# US 2012/0250804 A1 · Efficient Square-Root Free 2 Symbol Max-Log Receiver

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

- Number: US 2012/0250804 A1
- Document ID: US20120250804A1
- Status: Published application
- Kind: A1
- Application number: 13/433,873
- Filed: 2012-03-29
- Published: 2012-10-04
- Earliest claimed: 2011-03-30
- Assignees: NEC Laboratories America, Inc.
- Inventors: Narayan Prasad; Neda Cvijetic; Sampath Rangarajan; Ting Wang
- Web page: https://patentgrep.com/patent/US20120250804A1

## CPC

- H04L 25/0246: {with factorisation}
- H04L 25/03171: {Arrangements involving maximum a posteriori probability [MAP] detection}
- 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: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention employs a look up table based implementation for the metric computations which eliminate redundancy and substantially reduce the number of multiplications. Moreover, inventive method exploits the fact that the un-normalized constellation symbols are complex integers so that the product of a real-number and an un-normalized constellation symbol can be implemented by only additions. The inventive method also enables a greater efficiency for whitening colored noise prior to demodulation, one of which involves no square-root operation. The invention results in less complexity, faster operation, lower power consumption, without sacrificing performance

## Claims

### Claim 1

A method for a square-root free 2 symbol max-log receiver comprising the steps of:
i) obtaining linear transformations of a received two stream signal and a channel matrix without implementing square-root operations (100);
ii) listing out all possibilities for a first symbol of the said received two stream signal (101);
iii) building look-up-tables needed for computing first metrics associated with all possibilities for a first symbol of the said two stream signal (102);
iv) determining a second symbol of the two stream signal for each said first symbol listed out (103);
v) evaluating said first metrics for each said first symbol and second symbol pair using said look up tables (103);
vi) listing out all possibilities for said second symbol 2 (104);
vii) building look-up-tables needed for computing second metrics associated with all possibilities for a second symbol of said received two stream signal (105);
viii) determining a first symbol for each choice of said second symbol listed out (106);
ix) evaluating said second metrics for each said second symbol and first symbol pair using the look up tables (106);
vii) determining an exact max-log log likelihood ratio for each coded bit using said second metrics (107); and
viii) decoding a least one codeword in the two stream signal using the determined exact max-log log likelihood ratios for all bits (108).

### Claim 2 (depends on 1)

The method of claim 1, wherein said step i) obtaining linear transformations of a received signal comprises obtaining
Q
~
=
Q

[
1
/
r
0
,
0
0
0
1
/
r
1
,
1
]
,

r
⋓
0
,
1
=
r
0
,
1
/
r
0
,
0
and
θ
=
r
1
,
1
2
/
r
0
,
0
2
.

### Claim 3 (depends on 2)

The method of claim 2, wherein said step i) obtaining linear transformations of a received signal comprises multiplying a received vector z with {tilde over (Q)}H giving {tilde over (z)}={tilde over (Q)}Hz={tilde over (Q)}H(QRx+n)={tilde over (R)}x+ñ where
z
~
=
[
z
~
(
0
)
z
~
(
1
)
]
=
[
1
r
0
,
1
/
r
0
,
0
0
1
]

[
x
(
0
)
x
(
1
)
]
+
n
~
=
[
x
(
0
)
+
r
⋓
0
,
1

x
(
1
)
x
(
1
)
]
+
[
n
~
(
0
)
n
~
(
1
)
]
and QHQ=I with ñ˜Nc(0, diag{1r0,02,1/r1,12}).

### Claim 4 (depends on 1)

The method of claim 1, wherein said step i) obtaining linear transformations of a received signal comprises obtaining {tilde over (Q)},{hacek over (r)}0,1, r1,12 and θ via a modified QR decomposition for any Nr≧2 and using a channel matrix {tilde over (H)} and considering {tilde over (H)}=[{tilde over (h)}0,{tilde over (h)}hd 1] and obtaining α={tilde over (h)}0H{tilde over (h)}1;

### Claim 5 (depends on 1)

The method of claim 1, wherein said step i) obtaining linear transformations of a received signal comprises obtaining {tilde over (Q)},{hacek over (r)}0,1, r1,12 and θ via a modified QR decomposition for any Nr≧2 and using a channel matrix {tilde over (H)} and obtaining δ=∥{tilde over (h)}0∥2 and first column of {tilde over (Q)}=[{tilde over (q)}0,{tilde over (q)}1] as {tilde over (q)}0={tilde over (h)}0/δ.

### Claim 6 (depends on 1)

The method of claim 1, wherein said step i) obtaining linear transformations of a received signal comprises obtaining {tilde over (Q)},{hacek over (r)}0,1, r1,12 and θ via a modified QR decomposition for any Nr≧2 and using a channel matrix {tilde over (H)} and obtain the vector {tilde over (v)}={tilde over (h)}1−α{tilde over (q)}0; and r1,12=∥{tilde over (v)}∥2 and the second column of {tilde over (Q)}=[{tilde over (q)}0,{tilde over (q)}1] as {tilde over (q)}1={tilde over (v)}/r1,12.

### Claim 7 (depends on 1)

The method of claim 1, wherein said step i) obtaining linear transformations of a received signal comprises obtaining {tilde over (Q)},{hacek over (r)}0,1, r1,12 and θ via a modified QR decomposition for any Nr≧2 and using a channel matrix {tilde over (H)} and obtaining {hacek over (r)}0,1 as {hacek over (r)}0,1=α/δ.

### Claim 8 (depends on 1)

The method of claim 1, wherein said step i) obtaining linear transformations of a received signal comprises obtaining {tilde over (Q)},{hacek over (r)}0,1, r1,12 and θ via a modified QR decomposition for any Nr2 and using a channel matrix {tilde over (H)} and obtaining θ as θ=r1,12/δ.

### Claim 9 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises generating a soft bit k:k=0, 1, . . . B(v)−1, corresponding to transmitted symbol x(v): v=0, 1 using max-log approximation of LLR as follows:
L

(
b
k
,
v
)
≈
min
c
j
∈
S
k
,
v
,
0

(
z
~
-
R
~

c
j
)
H

[
r
0
,
0
2
0
0
r
1
,
1
2
]

(
z
~
-
R
~

c
j
)
-
min
c
j
∈
S
k
,
v
,
1

(
z
~
-
R
~

c
j
)
H

[
r
0
,
0
2
0
0
r
1
,
1
2
]

(
z
~
-
R
~

c
j
)

### Claim 10 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises generating a soft bit k:k=0, 1, . . . B(v)−1, corresponding to transmitted symbol x(v): v=0, 1 using max-log approximation of LLR wherein a vector cj=[cj(0), cj(1)]T with each element cj(v) is a complex symbol in the modulation constellation applied to layer v, and Sk,v,1 and Sk,v,0 denote the set containing all possible vector cj such that bit k of element cj(v) is equal to 1 and 0 respectively.

### Claim 11 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises considering soft bit calculation for a second layer (i.e. v=1), performing for each cj(1)εS(1):j=0, 1, . . . , K(1)−1, computing dj(1)=θ|{tilde over (z)}(1)−cj(1)|2.

### Claim 12 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises considering soft bit calculation for a second layer (i.e. v=1), performing for each cj(1)εS(1): j=0, 1, . . . , K(1)−1, computing soft estimate {tilde over (z)}(0)−{hacek over (r)}0,1cj(1) and then selecting a symbol ĉj(0)εS(0) that is closest to {tilde over (z)}(0)−{hacek over (r)}0,1cj(1).

### Claim 13 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises considering soft bit calculation for a second layer (i.e. v=1), performing for each cj(1)εS(1):j=0, 1, . . . , K(1)−1, computing dj(0)=|{tilde over (z)}(0)−ĉj(0)−{hacek over (r)}0,1cj(1)|2.

### Claim 14 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises considering soft bit calculation for a second layer (i.e. v=1), performing for each cj(1)εS(1):j=0, 1, . . . , K(1)−1, computing total distance djTOTAL=dj(0)+dj(1).

### Claim 15 (depends on 1)

The method of claim 1, wherein said steps iv), v) or viii), ix) comprises:
a) Determining
d
^
(
1
)
=
min
c
j
(
1
)
∈
S
(
1
)

{
d
j
TOTAL
}
,

c
^
j
(
1
)
=
arg


min
c
j
(
1
)
∈
S
(
1
)

{
d
j
TOTAL
}
and noting that ĉj(1)εS(1) is the symbol of layer-1 in the maximum likelihood (ML) decision. Letting {circumflex over (b)}k,1:k=0, 1, . . . , B(1)−1 be the bit-label of ĉj(1)εS(1);
b) computing each soft bit L(bk,1):k=0, 1, . . . , B(1)−1 as
L

(
b
k
,
1
)
=
r
0
,
0
2
(
d
^
(
1
)
-
min
d
m
TOTAL
∈
D
k
1

d
m
TOTAL
)


if


b
^
k
,
1
=
0
or
L

(
b
k
,
1
)
=
r
0
,
0
2
(
min
d
m
TOTAL
∈
D
k
0

d
m
TOTAL
-
d
^
(
1
)
)


if


b
^
k
,
1
=
1
;
and
c) where Dk1 and Dk0 denote the set containing all distances djTOTAL correspond to cj(1) that has that bit k equal to 1 and 0, respectively.

### Claim 16 (depends on 1)

The method of claim 1, wherein said steps iii) or vii) comprises looking at a max-log LLR expression and after expanding dj(0), dj(1), we drop the terms that do not influence the LLR.

### Claim 17 (depends on 1)

The method of claim 1, wherein said steps iii) or vii) comprises pulling out normalizing factors so that the modulation symbols are from un-normalized QAM constellations which contain integers. Then we can use the fact that the product of an integer and a real number can be obtained using just additions.

### Claim 18 (depends on 1)

The method of claim 1, wherein said steps iii) or vii) comprises forming LUTs containing common terms that mostly depend only on the channel coefficients. The entries of these LUTs are repeatedly accessed while computing all dj(0), dj(1) and multiplications are avoided.

### Claim 19 (depends on 1)

The method of claim 1, wherein said steps iii) or vii) comprises computing dj(1)=θ(cj,R(1))2+θ(cj,I(1))2−2{tilde over (z)}R(1)cj,R(1)θ−2{tilde over (z)}I(1)cj,I(1)θ.

### Claim 20 (depends on 1)

The method of claim 1, wherein said steps iii) or vii) comprises computing dj(1)=θ|{tilde over (z)}(1)−cj(1)|2 in a manner where all {d0(1)} can be computed with only 20 real multiplications.
