# US 2012/0250780 A1 · Method and device for pre-coding, and method and device for decoding

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

- Number: US 2012/0250780 A1
- Document ID: US20120250780A1
- Status: Published application
- Kind: A1
- Application number: 13/525,641
- Filed: 2012-06-18
- Published: 2012-10-04
- Earliest claimed: 2009-12-18
- Assignees: Huawei Technologies Co., Ltd.
- Inventors: Hui SHEN; Bin Li; Yi Luo
- Web page: https://patentgrep.com/patent/US20120250780A1

## CPC

- H04B 7/0413: MIMO systems
- H04B 7/0465: {taking power constraints at power amplifier or emission constraints, e.g. constant modulus, into account}
- H04L 25/03343: {Arrangements at the transmitter end}
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention relates to the field of wireless communications technologies, and discloses a method and device for pre-coding and a method and device for decoding. The present invention implements an interference alignment method with excellent performance, can effectively increase the capacity of a multi-user interference system and reduce the mutual interference among users, The method for pre-coding includes: calculating a pre-coding matrix for each transmitting end according to a sum of mean square errors of data vectors to be transmitted by each transmitting ends; and using the pre-coding matrix to pre-code the data to be transmitted by each transmitting end. The present invention has broad application prospects, for example, can be used in LTE and LTE-Advanced CoMP technology.

## Claims

### Claim 1

A method for pre-coding, comprising:
calculating a pre-coding matrix for each transmitting end according to a sum of mean square errors of data vectors to be transmitted by each transmitting end; and
using the pre-coding matrix to pre-code data to be transmitted by each transmitting end.

### Claim 2 (depends on 1)

The method for pre-coding according to claim 1, wherein the calculating the pre-coding matrix for each transmitting end according to the sum of mean square errors of the data vectors to be transmitted by each transmitting end comprises:
calculating the pre-coding matrix for each transmitting end according to a minimum value of the sum of mean square errors of data vectors to be transmitted by each transmitting end; or
calculating the pre-coding matrix for each transmitting end according to a minimum value of a product of the sum of mean square errors of data vectors to be transmitted by each transmitting end and a weight factor; or
calculating the pre-coding matrix for each transmitting end according to a minimum value of a sum of or a difference between the sum of mean square errors of data vectors to be transmitted by each transmitting end and a bias parameter.

### Claim 3 (depends on 1)

The method for pre-coding according to claim 1, wherein the calculating the pre-coding matrix for each transmitting end according to the sum of mean square errors of the data vectors to be transmitted by each transmitting end comprises:
constructing a corresponding Lagrangian function according to the minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end, or according to the minimum value of the product of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and the weight factor, or according to the minimum value of the sum of or the difference between the sum of mean square errors of the data vectors to be transmitted by each transmitting end and a bias parameter, and a corresponding transmission power constraint of a transmitting end;
according to an optimization condition of the Lagrangian function, obtaining an expression of the pre-coding matrix and an expression of a decoding matrix; and
using the expressing of the pre-coding matrix and the expression of the decoding matrix and an initial value of the pre-coding matrix to calculate through iteration to obtain the pre-coding matrix.

### Claim 4 (depends on 3)

The method according to claim 3, wherein, the method comprises:
constructing a Lagrangian function as follows according to the minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and the corresponding transmission power constraint of the transmitting end:
L

(
v
k
;
R
k
;
λ
k
)
=
∑
k
=
1
K


MSE
k
+
∑
k
=
1
K


λ
k

[
tr

(
v
k
H

v
k
)
-
P
k
]
according to a KKT condition of the Lagrangian function, obtaining the expression of the pre-coding matrix and the expression of the decoding matrix as follows:
v
k
=
(
∑
i
=
1
K


H
ik
H

R
i
H

R
i

H
ik
+
λ
k

I
)
-
1

H
kk
H

R
k
H


k
∈
{
1
,
⋯
,
K
}
R
k
=
v
k
H

H
kk
H

(
∑
i
=
1
K


H
ki

v
i

v
i
H

H
ki
H
+
σ
n
2

I
)
-
1


k
∈
{
1
,
⋯
,
K
}
using the expressing of the pre-coding matrix and the expression of the decoding matrix and an initial value of the pre-coding matrix to calculate through iteration to obtain the pre-coding matrix through iteration;
wherein, vk is a pre-coding matrix of a transmitting end k, Rk is a decoding matrix of a receiving end k, the transmission power constraint of the transmitting end k is expressed as Pk=tr(vkHvk), λk is a Lagrangian multiplier corresponding to the transmission power constraint of the transmitting end k, MSEk is a mean square error of a data vector to be transmitted by the transmitting end k, K represents the number of transmitting ends or receiving ends, k is a sequence number of a transmitting end, σn2 is a variance of Additive Gaussian White Noise, Hik is a channel coefficient matrix from the transmitting end k to a receiving end i, and i is a sequence number.

### Claim 5 (depends on 3)

The method according to claim 3, wherein, the method comprises:
constructing a Lagrangian function as follows according to the minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and the corresponding transmission power constraint of the transmitting end:
L

(
v
k
;
R
k
;
λ
k
)
=
∑
k
=
1
K


MSE
k
|
H
^
ij
〉
+
∑
k
=
1
K


λ
k

[
tr

(
v
k
H

v
k
)
-
P
k
]
according to a KKT condition of the Lagrangian function, obtaining the expression of the pre-coding matrix and the expression of the decoding matrix as follows:
V
k
=
[
∑
i
=
1
K


H
^
ik
H


R
i
H

R
i

H
^
ik
+
λ
k

I
+

σ
h
2

tr

(
∑
i
=
1
K


R
i
H

R
i
)

I
]
-
1


H
^
kk
H


R
k
H
R
k
=

v
k
H


H
^
kk
H

(
∑
i
=
1
K


H
^
ki

v
i


v
i
H


H
^
ki
H
+

σ
n
2

I
+

σ
h
2

I
)
-
1
using the expressing of the pre-coding matrix and the expression of the decoding matrix and an initial value of the pre-coding matrix to calculate through iteration to obtain the pre-coding matrix;
wherein, vk is a pre-coding matrix of a transmitting end k, Rk is a decoding matrix of a receiving end k, the transmission power constraint of the transmitting end k is expressed as Pk=tr(vkHvk), λk is a Lagrangian multiplier corresponding to the transmission power constraint of the transmitting end k, MSEk|Ĥij is a mean square error of a data vector to be transmitted by the transmitting end k, an estimated, value of a channel coefficient matrix from a transmitting end j to a receiving end i is Ĥij=Hij+eij, Hij is a channel coefficient matrix from the transmitting end j to the receiving end i, eij is an estimated error of the channel coefficient matrix from the transmitting end j to the receiving end i, K represents the number of transmitting ends or receiving ends, k, i and j are sequence numbers, σn2 is a variance of Additive Gaussian White Noise, σh2 is a mean square deviation of a channel estimated error, and σh2 satisfies E{eijeijH}=σh2I.

### Claim 6 (depends on 3)

The method for pre-coding according to claim 3, wherein the using the expressing of the pre-coding matrix and the expression of the decoding matrix and the initial value of the pre-coding matrix to calculate through iteration to obtain the pre-coding matrix comprises:
according to the initial value of the pre-coding matrix, using the expression of the decoding matrix to calculate each decoding matrix;
using a calculated decoding matrix to calculate to obtain a Lagrangian multiplier of current iteration;
according to the Lagrangian multiplier of the current iteration, updating the pre-coding matrix; and
using an updated pre-coding matrix to replace the initial value of the pre-coding matrix, so as to calculate the pre-coding matrix through iteration.

### Claim 7 (depends on 6)

The method for pre-coding according to claim 6, wherein the using the updated pre-coding matrix to replace the initial value of the pre-coding matrix, so as to calculate the pre-coding matrix through iteration comprises:
when the number of times of iteration reaches a predetermined value, using a pre-coding matrix obtained in the current iteration as the pre-coding matrix; or
when a bound norm of a difference between the pre-coding matrix obtained in the current iteration and a pre-coding matrix obtained in previous iteration is less than a predetermined value, using the pre-coding matrix obtained in the current iteration as the pre-coding matrix; or
when an absolute value of a difference between the sum of mean square errors of transmitting ends that is obtained in the current iteration and the sum of mean square errors of the transmitting ends that is obtained in the previous iteration is less than a predetermined value, using the pre-coding matrix obtained in the current iteration as the pre-coding matrix.

### Claim 8

A method for decoding, comprising:
receiving data from a transmitting end, wherein the data is pre-coded by using a pre-coding matrix; and
using a decoding matrix to decode received data, so as to obtain a valid signal;
wherein, the decoding matrix and the pre-coding matrix are obtained by calculating according to a sum of mean square errors of data vectors to be transmitted by each transmitting end.

### Claim 9 (depends on 8)

The method for decoding according to claim 8, wherein the decoding matrix and the pre-coding matrix are obtained by calculating according to a sum of mean square errors of data vectors to be transmitted by each transmitting ends and a corresponding transmission power constraint of a transmitting end, and the decoding matrix has an expression as follows:
R
k
=

v
k
H


H
kk
H

(
∑
i
=
1
K


H
ki

v
i


v
i
H


H
ki
H
+

σ
n
2

I
)
-
1


k
∈
{
1
,
⋯
,
K
}
,
or
R
k
=

v
k
H


H
^
kk
H

(
∑
i
=
1
K


H
^
ki

v
i


v
i
H


H
^
ki
H
+

σ
n
2

I
+

σ
h
2

I
)
-
1
wherein, vk is a pre-coding matrix of a transmitting end k, Rk is a decoding matrix of a receiving end k, Hki is a channel coefficient matrix from a transmitting end i to the receiving end k, Ĥki is an estimated value of the channel coefficient matrix from the transmitting end i to the receiving end k, σn2 is a variance of Additive Gaussian White Noise, σn2 is a mean square deviation of a channel estimated error, σh2 satisfies E{eijeijH}=σh2I, and i is a sequence number.

### Claim 10

A device for pre-coding, comprising:
a calculation unit, configured to calculate a pre-coding matrix for each transmitting end according to a sum of mean square errors of data vectors to be transmitted by each transmitting end; and
a pre-coding unit, configured to use the pre-coding matrix obtained by the calculation unit to pre-code data to be transmitted by each transmitting end.

### Claim 11 (depends on 10)

The device for pre-coding according to claim 10, wherein the calculation unit is configured to calculate the pre-coding matrix for each transmitting end according to the sum of mean square errors of the data vectors to be transmitted by each transmitting end; or
calculate the pre-coding matrix for each transmitting end according to a minimum value of a product of the sum of mean square errors of data vectors to be transmitted by each transmitting end and a weight factor; or
calculate the pre-coding matrix for each transmitting end according to a minimum value of a sum of or a difference between the sum of mean square errors of data vectors to be transmitted by each transmitting end and a bias parameter.

### Claim 12 (depends on 10)

The device for pre-coding according to claim 10, wherein, the calculation unit comprises:
an expression acquisition module, configured to construct a corresponding Lagrangian function according to the minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end, or according to the minimum value of the product of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and a weight factor, or according to a minimum value of a sum of or a difference between the sum of mean square errors of the data vectors to be transmitted by each transmitting end and a bias parameter, and a corresponding transmission power constraint of a transmitting end; and obtain an expression of the pre-coding matrix and an expression of the decoding matrix according to an optimization condition of the Lagrangian function; and
an iteration module, configured to, by using the expression of the pre-coding matrix and the expression of the decoding matrix that are obtained by the expression acquisition module and an initial value of the pre-coding matrix, calculate through iteration to obtain the pre-coding matrix.

### Claim 13 (depends on 10)

The device for pre-coding according to claim 10, wherein,
the expression acquisition module is configured to construct a Lagrangian function as follows according to the minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and a corresponding transmission power constraint of a transmitting end:
L

(
v
k
;
R
k
;
λ
k
)
=
∑
k
=
1
K


MSE
k
+
∑
k
=
1
K


λ
k

[
tr
(

v
k
H

v
k
)
-
P
k
]
according to a KKT condition of the Lagrangian function, an expression of the pre-coding matrix and an expression of the decoding matrix as follows are obtained:
v
k
=
(
∑
i
=
1
K


H
ik
H


R
i
H

R
i

H
ik
+
λ
k

I
)
-
1


H
kk
H


R
k
H


k
∈
{
1
,
⋯
,
K
}
R
k
=

v
k
H


H
kk
H

(
∑
i
=
1
K


H
ki

v
i


v
i
H


H
ki
H
+

σ
n
2

I
)
-
1


k
∈
{
1
,
⋯
,
K
}
,
or,
the expression acquisition module is configured to construct a Lagrangian function as follows according to the minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and the corresponding transmission power constraint of the transmitting end:
L

(
v
k
;
R
k
;
λ
k
)
=
∑
k
=
1
K


MSE
k
|
H
^
ij
〉
+
∑
k
=
1
K


λ
k

[
tr
(

v
k
H

v
k
)
-
P
k
]
according to the KKT condition of the Lagrangian function, the expression of the pre-coding matrix and the expression of the decoding matrix as follows are obtained:
v
k
=
[
∑
i
=
1
K


H
^
ik
H


R
i
H

R
i

H
^
ik
+
λ
k

I
+

σ
h
2

tr

(
∑
i
=
1
K


R
i
H

R
i
)

I
]
-
1


H
^
kk
H


R
k
H
R
k
=

v
k
H


H
^
kk
H

(
∑
i
=
1
K


H
^
ki

v
i


v
i
H


H
^
ki
H
+

σ
n
2

I
+

σ
h
2

I
)
-
1
wherein, vk is a pre-coding matrix of a transmitting end k, Rk is a decoding matrix of a receiving end k, the transmission power constraint of the transmitting end k is expressed as Pk=tr(vkHvk), λk is a Lagrangian multiplier corresponding to the transmission power constraint of the transmitting end k, MSEk is a mean square error of a data vector to be transmitted by the transmitting k, MSEk|Ĥij is a mean square error of a data vector to be transmitted by the transmitting end k, Ĥij=Hij+eij is an estimated value of a channel coefficient matrix from a transmitting end j to a receiving end i, Hij is a channel coefficient matrix from the transmitting end j to the receiving end i, eij is an estimated error of the channel coefficient matrix from the transmitting end j to the receiving end i, σn2 is a variance of Additive Gaussian White Noise, σh2 is a mean square deviation of a channel estimated error, σh2 satisfies E{eijeijH}=σh2I, K represents the number of transmitting ends or receiving ends, and k, i and j are sequence numbers.

### Claim 14 (depends on 10)

The device for pre-coding according to claim 10, wherein,
the iteration module is configured to: according to an initial value of the pre-coding matrix, use the expression of the decoding matrix to calculate each decoding matrix; use a calculated decoding matrix to calculate to obtain a Lagrangian multiplier of the current iteration; update the pre-coding matrix according to the Lagrangian multiplier of current iteration; replace the initial value of the pre-coding matrix with an updated pre-coding matrix, and calculate the pre-coding matrix through iteration.

### Claim 15

A device for decoding, comprising:
a receiving unit, configured to receive data from a transmitting end, wherein the data is pre-coded by using a pre-coding matrix; and
a decoding unit, configured to use a decoding matrix to decoding data received by the receiving unit, so as to obtain a valid signal, wherein the pre-coding matrix and the decoding matrix are obtained by calculating according to a sum of mean square errors of data vectors to be transmitted by each transmitting end.

### Claim 16 (depends on 15)

The device for decoding according to claim 15, wherein the decoding matrix and the pre-coding matrix are obtained through calculation according to a minimum value of the sum of mean square errors of the data vectors to be transmitted by each transmitting end and a corresponding transmission power constraint of a transmitting end, the decoding unit is configured to use a decoding matrix having an expression as follows to decode the data received by the receiving unit, so as to obtain the valid signal:
R
k
=

v
k
H


H
kk
H

(
∑
i
=
1
K


H
ki

v
i


v
i
H


H
ki
H
+

σ
n
2

I
)
-
1


k
∈
{
1
,
⋯
,
K
}
,
or
R
k
=

v
k
H


H
^
kk
H

(
∑
i
=
1
K


H
^
ki

v
i


v
i
H


H
^
ki
H
+

σ
n
2

I
+

σ
h
2

I
)
-
1
wherein, vk is a pre-coding matrix of a transmitting end k, Rk is a decoding matrix of a receiving end k, Hki is a channel coefficient matrix from a transmitting end i to the receiving end k, Ĥki is an estimated value of a channel coefficient matrix from the transmitting end i to the receiving end k, σn2 is a variance of Additive Gaussian White Noise, σh2 is a mean square deviation of a channel estimated error, σh2 satisfies E{eijeijH}=σh2I, and i is a sequence number.
