# US 10,771,092 B2 · Method and apparatus for low density parity check channel coding in wireless communication system

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

- Number: US 10,771,092 B2
- Document ID: US10771092B2
- Status: Granted
- Kind: B2
- Application number: 16/423,175
- Filed: 2019-05-28
- Published: 2020-02-13
- Granted: 2020-09-08
- Earliest claimed: 2017-06-27
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co.,Ltd.
- Inventors: Jie Jin; Ivan Leonidovich Mazurenko; Aleksandr Aleksandrovich Petiushko; Chaolong Zhang
- Web page: https://patentgrep.com/patent/US10771092B2

## CPC

- H03M 13/116: {Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices}
- H03M 13/255: {with Low Density Parity Check [LDPC] codes}
- H03M 13/1174: {Parity-check or generator matrices built from sub-matrices representing known block codes such as, e.g. Hamming codes, e.g. generalized LDPC codes}
- H03M 13/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H03M 13/618: {Shortening and extension of codes}
- H03M 13/6362: {by puncturing}
- H03M 13/6516: {Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments of this application disclose provides a low density parity check (LDPC) channel encoding method for use in a wireless communications system. A communication device encodes an input bit sequence by using a LDPC matrix, to obtain an encoded bit sequence for transmission. The LDPC matrix is obtained based on a lifting factor Z and a base matrix. Embodiments of the application provide eight particular designs of the base matrix. The encoding method provided in the embodiments of the application can be used in various communications systems including the fifth generation (5G) telecommunication systems, and can support various encoding requirements for information bit sequences with different code lengths.

## Claims

### Claim 1

A method for wireless communication, comprising:
obtaining, by a communication apparatus, an input sequence c, wherein the input sequence comprises K bits, K>1;
encoding, by the communication apparatus, the input sequence c using a matrix H, to obtain an encoded sequence d, wherein the encoded sequence d comprises N bits, N>1; and
outputting, by the communication apparatus, the encoded sequence d;
wherein the matrix H is determined according to a base matrix and a lifting factor Z, Z is a positive integer;
wherein the base matrix comprises m rows and n columns, and elements in the base matrix are respectively represented by their row index i and column index j, where 0≤i<m, 0≤j<n;
wherein an element in the base matrix is either a zero-element or a non-zero-element, and a non-zero-element at row i and column j has a value Vi,j;
wherein each zero element in the base matrix corresponds to an all-zero matrix of size Z×Z in the matrix H, and a non-zero-element in row i and column j in the base matrix corresponds to a circular permutation matrix hi,j of size Z×Z in the matrix H;
wherein the circular permutation matrix hi,j equals to a Z×Z identity matrix been circularly shifted to the right for Pi,j times, where Pi,j=mod(Vi,j, Z); and
wherein the base matrix comprises the following rows with non-zero-elements, and the non-zero elements whose row indexes (i), column indexes (j) and corresponding values Vi,j are as follows:
i
j
Vi, j
0
0
0
1
0
2
0
3
0
6
0
9
0
10
0
11
0
1
0
137
3
124
4
0
5
0
6
88
7
0
8
0
9
55
11
0
12
0
2
0
20
1
94
3
99
4
9
8
108
10
1
12
0
13
0
3
1
38
2
15
4
102
5
146
6
12
7
57
8
53
9
46
10
0
13
0.

### Claim 2 (depends on 1)

The method according to claim 1, wherein N is equal to 50×Z.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the input sequence c is represented as c={c0, c1, c2, . . . , cK-1}, and the encoded sequence d is represented as d={d0, d1, d2, . . . , dN−1}, wherein in encoding the input sequence c using the matrix H, an element ck (k=0, 1, 2, . . . , K−1) in the input sequence c and an element dn (n=0, 1, 2, . . . , N−1) in the encoded sequence d satisfy:
for k=2Z to K−1,
if ck is not a filling bit, dk-2z=ck; and
if ck is a filling bit, ck=0, and dk-2Z is a filling bit.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the input sequence c is represented as c={c0, c1, c2, . . . , cK-1}, and the encoded sequence d is represented as d={d0, d1, d2, . . . , dN−1}, wherein the encoded sequence d comprises K0 bits from the input sequence c and N-K0 parity bits from a parity sequence w, the parity sequence w is represented as w={w0, w1, w2, . . . , wN−K0-1}, wherein K0 is an integer and 0<K0≤K;
wherein the matrix H, the parity sequence w and the input sequence c satisfy:
H
×
[
c
w
]
=
0
,
wherein c=[c0, c1, c2, . . . , cK-1]T, w=[w0, w1, w2, . . . , wn-K0-1]T, and 0 is a column vector in which all elements are equal to zero.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the parity sequence w has N+2Z-K bits and the parity sequence w is represented as w={w0, w1, w2, . . . , wN+2Z-K-1}.

### Claim 6 (depends on 5)

The method according to claim 5, wherein in encoding the input sequence c using the matrix H, an element in the parity sequence w and an element in the encoded sequence d satisfy:
for k=K to N+2Z−1,
dk-2z=wk-K.

### Claim 7 (depends on 1)

The method according to claim 1, wherein Z is a minimum value that satisfies Kb×Z≥K, and Kb is one of {6, 8, 9, 10}.

### Claim 8 (depends on 7)

The method according to claim 7, wherein Kb satisfies:
K
b
=
{
10
,
K
>
640
9
,
560
<
K
≤
640
8
,
192
<
K
≤
560
6
,
others
.

### Claim 9 (depends on 1)

The method according to claim 1, wherein Z is one of 5, 10, 20, 40, 80, 160 and 320.

### Claim 10 (depends on 1)

The method according to claim 1, wherein m≤42 and n≤52.

### Claim 11 (depends on 1)

The method according to claim 1, wherein the base matrix further comprises one or more rows with non-zero-elements, wherein row indexes (i), column indexes (j) and corresponding values Vi,j of the non-zero-elements are as follows:
i
j
Vi, j
4
0
0
1
136
11
157
14
0
5
0
0
1
131
5
142
7
141
11
64
15
0
6
0
0
5
124
7
99
9
45
11
148
16
0
7
1
0
5
45
7
148
11
96
13
78
17
0
8
0
0
1
65
12
87
18
0
9
1
0
8
97
10
51
11
85
19
0
10
0
0
1
17
6
156
7
20
20
0
11
0
0
7
7
9
4
13
2
21
0
12
1
0
3
113
11
48
22
0
13
0
0
1
112
8
102
13
26
23
0
14
1
0
6
138
11
57
13
27
24
0
15
0
0
10
73
11
99
25
0
16
1
0
9
79
11
111
12
143
26
0
17
1
0
5
24
11
109
12
18
27
0
18
0
0
6
18
7
86
28
0
19
0
0
1
158
10
154
29
0
20
1
0
4
148
11
104
30
0
21
0
0
8
17
13
33
31
0
22
1
0
2
4
32
0
23
0
0
3
75
5
158
33
0
24
1
0
2
69
9
87
34
0
25
0
0
5
65
35
0
26
2
0
7
100
12
13
13
7
36
0
27
0
0
6
32
37
0
28
1
0
2
126
5
110
38
0
29
0
0
4
154
39
0
30
2
0
5
35
7
51
9
134
40
0
31
1
0
13
20
41
0
32
0
0
5
20
12
122
42
0
33
2
0
7
88
10
13
43
0
34
0
0
12
19
13
78
44
0
35
1
0
5
157
11
6
45
0
36
0
0
2
63
7
82
46
0
37
10
0
13
144
47
0
38
1
0
5
93
11
19
48
0
39
0
0
7
24
12
138
49
0
40
2
0
10
36
13
143
50
0
41
1
0
5
2
11
55
51
0.

### Claim 12

An apparatus for wireless communication, comprising at least one processor configured to:
obtain an input sequence c, wherein the input sequence comprises K bits, K>1;
encode the input sequence c using a matrix H, to obtain an encoded sequence d, wherein the encoded sequence d comprises N bits, N>1; and
output the encoded sequence d;
wherein the matrix H is determined according to a base matrix and a lifting factor Z, Z is a positive integer;
wherein the base matrix comprises m rows and n columns, and elements in the base matrix are respectively represented by their row index i and column index j, where 0≤i<m, 0≤j<n;
wherein an element in the base matrix is either a zero-element or a non-zero element, and a non-zero-element at row i and column j has a value Vi,j;
wherein each zero element in the base matrix corresponds to an all-zero matrix of size Z×Z in the matrix H, and a non-zero-element in row i and column j in the base matrix corresponds to a circular permutation matrix hi,j of size Z×Z in the matrix H;
wherein the circular permutation matrix hi,j equals to a Z×Z identity matrix been circularly shifted to the right for Pi,j times, where Pi,j=mod(Vi,j, Z); and
wherein the base matrix comprises the following rows with non-zero-elements, and the non-zero elements whose row indexes (i), column indexes (j) and corresponding values Vi,j are as follows:
i
j
Vi, j
0
0
0
1
0
2
0
3
0
6
0
9
0
10
0
11
0
1
0
137
3
124
4
0
5
0
6
88
7
0
8
0
9
55
11
0
12
0
2
0
20
1
94
3
99
4
9
8
108
10
1
12
0
13
0
3
1
38
2
15
4
102
5
146
6
12
7
57
8
53
9
46
10
0
13
0.

### Claim 13 (depends on 12)

The apparatus according to claim 12, wherein N is equal to 50×Z.

### Claim 14 (depends on 12)

The apparatus according to claim 12, wherein the input sequence c is represented as c={c0, c1, c2, . . . , cK-1}, and the encoded sequence d is represented as d={d0, d1, d2, . . . , dN−1}, wherein in encoding the input sequence c using the matrix H, an element ck (k=0, 1, 2, . . . , K−1) in the input sequence c and an element dn (n=0, 1, 2, . . . , N−1) in the encoded sequence d satisfy:
for k=2Z to K−1,
if ck is not a filling bit, dk-2z=ck; and
if ck is a filling bit, ck=0, and dk-2Z is a filling bit.

### Claim 15 (depends on 12)

The apparatus according to claim 12, wherein the input sequence c is represented as c={c0, c1, c2, . . . , cK-1}, and the encoded sequence d is represented as d={d0, d1, d2, . . . , dN−1}, wherein the encoded sequence d comprises K0 bits from the input sequence c and N-K0 parity bits from a parity sequence w, the parity sequence w is represented as w={w0, w1, w2, . . . , wN−K0-1}, wherein K0 is an integer and 0<K0≤K;
wherein the matrix H, the parity sequence w and the input sequence c satisfy:
H
×
[
c
w
]
=
0
,
wherein c=[c0, c1, c2, . . . , cK-1]T, w=[w0, w1, w2, . . . , wn-K0-1]T, and 0 is a column vector in which all elements are equal to zero.

### Claim 16 (depends on 15)

The apparatus according to claim 15, wherein the parity sequence w has N+2Z-K bits and the parity sequence w is represented as w={w0, w1, w2, . . . , wN+2Z-K-1}.

### Claim 17 (depends on 16)

The apparatus according to claim 16, wherein in encoding the input sequence c using the matrix H, an element in the parity sequence w and an element in the encoded sequence d and satisfy:
for k=K to N+2Z−1,
dk-2z=wk-K.

### Claim 18 (depends on 12)

The apparatus according to claim 12, wherein Z is a minimum value that satisfies Kb×Z≥K, and Kb is one of {6, 8, 9, 10}.

### Claim 19 (depends on 18)

The apparatus according to claim 18, wherein Kb satisfies:
K
b
=
{
10
,
K
>
640
9
,
560
<
K
≤
640
8
,
192
<
K
≤
560
6
,
others
.

### Claim 20 (depends on 12)

The apparatus according to claim 12, wherein Z is one of 5, 10, 20, 40, 80, 160, and 320.

### Claim 21 (depends on 12)

The apparatus according to claim 12, wherein m≤42 and n≤52.

### Claim 22 (depends on 12)

The apparatus according to claim 12, wherein the base matrix further comprises one or more rows with non-zero-elements, wherein row indexes (i), column indexes (j) and corresponding values Vi,j of the non-zero-elements are as follows:
i
j
Vi, j
4
0
0
1
136
11
157
14
0
5
0
0
1
131
5
142
7
141
11
64
15
0
6
0
0
5
124
7
99
9
45
11
148
16
0
7
1
0
5
45
7
148
11
96
13
78
17
0
8
0
0
1
65
12
87
18
0
9
1
0
8
97
10
51
11
85
19
0
10
0
0
1
17
6
156
7
20
20
0
11
0
0
7
7
9
4
13
2
21
0
12
1
0
3
113
11
48
22
0
13
0
0
1
112
8
102
13
26
23
0
14
1
0
6
138
11
57
13
27
24
0
15
0
0
10
73
11
99
25
0
16
1
0
9
79
11
111
12
143
26
0
17
1
0
5
24
11
109
12
18
27
0
18
0
0
6
18
7
86
28
0
19
0
0
1
158
10
154
29
0
20
1
0
4
148
11
104
30
0
21
0
0
8
17
13
33
31
0
22
1
0
2
4
32
0
23
0
0
3
75
5
158
33
0
24
1
0
2
69
9
87
34
0
25
0
0
5
65
35
0
26
2
0
7
100
12
13
13
7
36
0
27
0
0
6
32
37
0
28
1
0
2
126
5
110
38
0
29
0
0
4
154
39
0
30
2
0
5
35
7
51
9
134
40
0
31
1
0
13
20
41
0
32
0
0
5
20
12
122
42
0
33
2
0
7
88
10
13
43
0
34
0
0
12
19
13
78
44
0
35
1
0
5
157
11
6
45
0
36
0
0
2
63
7
82
46
0
37
10
0
13
144
47
0
38
1
0
5
93
11
19
48
0
39
0
0
7
24
12
138
49
0
40
2
0
10
36
13
143
50
0
41
1
0
5
2
11
55
51
0.

### Claim 23 (depends on 12)

The apparatus according to claim 12, further comprising at least one memory configured to store the base matrix, one or more lifting factors Z, or one or more circular permutation matrices.

### Claim 24 (depends on 12)

The apparatus according to claim 12, further comprising at least one memory configured to store parameters associate with the matrix H.

### Claim 25 (depends on 12)

The apparatus according to claim 12, further comprising a transceiver configured to:
receive the input sequence and transmit the encoded sequence d.

### Claim 26

A non-transitory computer-readable storage medium, storing instructions, which, when executed by a computer, cause the computer to perform a process that comprises:
obtain an input sequence c, wherein the input sequence comprises K bits, K>1;
encode the input sequence c using a matrix H, to obtain an encoded sequence d, wherein the encoded sequence d comprises N bits, N>1; and
output the encoded sequence d;
wherein the matrix H is determined according to a base matrix and a lifting factor Z;
wherein the base matrix comprises m rows and n columns, and elements in the base matrix are respectively represented by their row index i and column index j, where 0≤i<m, 0≤j<n;
wherein an element in the base matrix is either a zero-element or a non-zero element, and a non-zero-element at row i and column j has a value Vi,j;
wherein each zero element in the base matrix corresponds to an all-zero matrix of size Z×Z in the matrix H, and a non-zero-element in row i and column j in the base matrix corresponds to a circular permutation matrix hi,j of size Z×Z in the matrix H;
wherein the circular permutation matrix hi,j equals to a Z×Z identity matrix been circularly shifted to the right for Pi,j times, where Pi,j=mod(Vi,j, Z); and
wherein the base matrix comprises rows the following with non-zero-elements, and the non-zero elements whose row indexes (i), column indexes (j) and corresponding values Vi,j are as follows:
i
j
Vi, j
0
0
0
1
0
2
0
3
0
6
0
9
0
10
0
11
0
1
0
137
3
124
4
0
5
0
6
88
7
0
8
0
9
55
11
0
12
0
2
0
20
1
94
3
99
4
9
8
108
10
1
12
0
13
0
3
1
38
2
15
4
102
5
146
6
12
7
57
8
53
9
46
10
0
13
0.

### Claim 27 (depends on 26)

The non-transitory computer-readable storage medium according to claim 26, wherein the input sequence c is represented as c={c0, c1, c2, . . . , cK-1}, and the encoded sequence d is represented as d={d0, d1, d2, . . . , dN−1}, an element ck (k=0, 1, 2, . . . , K−1) in the input sequence c and an element dn (n=0, 1, 2, . . . , N−1) in the encoded sequence d satisfy:
for k=2Z to K−1,
if ck is not a filling bit, dk-2z=ck; and
if ck is a filling bit, ck=0, and dk-2Z is a filling bit.

### Claim 28 (depends on 26)

The non-transitory computer-readable storage medium according to claim 26, wherein the input sequence c is represented as c={c0, c1, c2, . . . , cK-1}, and the encoded sequence d is represented as d={d0, d1, d2, . . . , dN−1}, wherein the encoded sequence d comprises K0 bits from the input sequence c and N-K0 parity bits from a parity sequence w, the parity sequence w is represented as w={w0, w1, w2, . . . , wN−K0-1}, wherein K0 is an integer and 0<K0≤K;
wherein the matrix H, the parity sequence w and the input sequence c satisfy:
H
×
[
c
w
]
=
0
,
wherein c=[c0, c1, c2, . . . , cK-1]T, w=[w0, w1, w2, . . . , wn-K0-1]T, and 0 is a column vector in which all elements are equal to zero.

### Claim 29 (depends on 28)

The non-transitory computer-readable storage medium according to claim 28, wherein the parity sequence w has N+2Z-K bits and the parity sequence w is represented as w={w0, w1, w2, . . . , wN+2Z-K-1}, an element in the parity sequence w and an element in the encoded sequence d and satisfy:
for k=K to N+2Z−1,
dk-2z=wk-K.

### Claim 30 (depends on 26)

The non-transitory computer-readable storage medium according to claim 26, wherein the base matrix further comprises one or more rows with non-zero-elements, wherein row indexes (i), column indexes (j) and corresponding values Vi,j of the non-zero-elements are as follows:
i
j
Vi, j
4
0
0
1
136
11
157
14
0
5
0
0
1
131
5
142
7
141
11
64
15
0
6
0
0
5
124
7
99
9
45
11
148
16
0
7
1
0
5
45
7
148
11
96
13
78
17
0
8
0
0
1
65
12
87
18
0
9
1
0
8
97
10
51
11
85
19
0
10
0
0
1
17
6
156
7
20
20
0
11
0
0
7
7
9
4
13
2
21
0
12
1
0
3
113
11
48
22
0
13
0
0
1
112
8
102
13
26
23
0
14
1
0
6
138
11
57
13
27
24
0
15
0
0
10
73
11
99
25
0
16
1
0
9
79
11
111
12
143
26
0
17
1
0
5
24
11
109
12
18
27
0
18
0
0
6
18
7
86
28
0
19
0
0
1
158
10
154
29
0
20
1
0
4
148
11
104
30
0
21
0
0
8
17
13
33
31
0
22
1
0
2
4
32
0
23
0
0
3
75
5
158
33
0
24
1
0
2
69
9
87
34
0
25
0
0
5
65
35
0
26
2
0
7
100
12
13
13
7
36
0
27
0
0
6
32
37
0
28
1
0
2
126
5
110
38
0
29
0
0
4
154
39
0
30
2
0
5
35
7
51
9
134
40
0
31
1
0
13
20
41
0
32
0
0
5
20
12
122
42
0
33
2
0
7
88
10
13
43
0
34
0
0
12
19
13
78
44
0
35
1
0
5
157
11
6
45
0
36
0
0
2
63
7
82
46
0
37
10
0
13
144
47
0
38
1
0
5
93
11
19
48
0
39
0
0
7
24
12
138
49
0
40
2
0
10
36
13
143
50
0
41
1
0
5
2
11
55
51
0.