# US 2024/0007130 A1 · Channel coding method, processing device, communication method and device

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

- Number: US 2024/0007130 A1
- Document ID: US20240007130A1
- Status: Published application
- Kind: A1
- Application number: 18/170,725
- Filed: 2023-02-17
- Published: 2024-01-04
- Earliest claimed: 2022-06-30
- Assignees: Beijing ESWIN Computing Technology Co., Ltd.; Guangzhou Transa Semi Information Technology Co., Ltd.
- Applicants: Beijing ESWIN Computing Technology Co., Ltd.; Guangzhou transa Semi Information Technology Co., Ltd.
- Inventors: Yanqi WU; Yanzhong DAI; Sujiang RONG
- Web page: https://patentgrep.com/patent/US20240007130A1

## CPC

- H03M 13/036: {Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error}
- H04L 1/0013: {Rate matching, e.g. puncturing or repetition of code symbols}
- H03M 13/1185: {wherein the parity-check matrix comprises a part with a double-diagonal}
- H03M 13/635: {Error control coding in combination with rate matching}
- 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/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- 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

There are provided a channel coding method, a processing device, a communication method and a device. The channel coding method includes: using a generating matrix or a check matrix of QC-LDPC codes to channel-encode or channel-decode a code stream, wherein a code rate of the generating matrix or the check matrix is 1/6, 1/4 or 1/3. The method can be used in a transmission environment with a low signal-noise ratio and a long distance.

## Claims

### Claim 1

A channel coding method, comprising:
using a generating matrix or a check matrix of QC-LDPC codes to channel-encode or channel-decode a code stream, wherein
a code rate of the generating matrix or the check matrix is 1/6, 1/4 or 1/3.

### Claim 2 (depends on 1)

The channel coding method according to claim 1, wherein a number of columns corresponding to systematic bits in a permutation matrix corresponding to the generating matrix or the check matrix is Ns, and a number of rows of the permutation matrix is Nrow,
for 1/6 code rate, Ns=4, and Nrow=20;
for 1/4 code rate, Ns=6, and Nrow=18; and
for 1/3 code rate, Ns=8, and Nrow=16.

### Claim 3 (depends on 2)

The channel coding method according to claim 2, wherein a total weight range of the permutation matrix is from 79 to 88;
for 1/6 code rate, the row weight of each row in the base matrix is equal to 5 or 4;
for 1/4 code rate, the row weight of each row in the base matrix is equal to 5; and
for 1/3 code rate, the row weight of each row in the base matrix is equal to 6 or 5.

### Claim 4 (depends on 1)

The channel coding method according to claim 1, wherein the permutation matrix for 1/6 code rate comprises:
a permutation matrix of a code length of 1944:
[
-
-
19
35
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
40
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
53
-
-
28
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
38
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
19
-
-
58
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
80
-
-
11
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
30
-
-
46
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
17
-
-
26
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
65
50
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
50
-
43
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
27
-
-
-
0
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
50
-
-
56
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
18
-
-
52
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
60
-
-
77
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
15
-
-
48
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
58
-
-
44
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
18
-
-
31
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
12
80
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
42
-
-
62
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
49
-
-
25
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]
a permutation matrix of a code length of 1296:
[
-
-
46
48
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
42
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
41
-
-
33
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
30
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
11
-
-
49
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
39
-
-
6
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
52
-
-
31
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
42
-
-
28
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
41
27
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
41
-
23
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
17
-
-
-
0
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
12
-
-
49
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
52
-
-
5
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
39
-
-
35
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
15
-
-
19
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
33
-
-
48
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
42
-
-
2
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
36
20
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
27
-
-
25
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
22
-
-
42
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]
or, a permutation matrix of a code length of 648:
[
4
-
-
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
11
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
7
-
-
21
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
1
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
23
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
24
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
25
-
-
7
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
4
-
-
1
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
26
-
5
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
18
23
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
24
0
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
6
-
-
10
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
10
-
-
8
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
7
-
9
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
18
-
-
18
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
16
-
-
24
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
9
-
-
12
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
13
11
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
1
19
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
23
-
-
14
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]

### Claim 5 (depends on 1)

The channel coding method according to claim 1, wherein the permutation matrix for 1/4 code rate comprises:
a permutation matrix of a code length of 1944:
[
53
79
-
-
-
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
44
-
19
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
60
-
-
-
-
43
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
55
48
-
-
-
20
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
24
7
23
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
66
-
-
66
15
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
22
17
-
-
-
24
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
2
-
-
-
29
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
14
-
-
-
-
31
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
1
-
-
-
-
70
0
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
41
-
-
-
-
14
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
8
51
-
-
-
18
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
26
-
-
-
-
78
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
18
-
-
-
-
44
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
75
26
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
21
-
11
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
8
74
-
-
-
22
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
27
-
5
-
-
23
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]
a permutation matrix a code length of 1296:
[
19
-
38
-
12
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
17
-
0
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
44
-
5
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
24
-
46
-
5
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
46
-
20
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
45
-
11
5
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
15
-
22
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
1
8
-
18
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
25
33
48
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
4
-
36
-
0
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
28
51
15
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
30
15
-
29
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
26
-
44
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
0
-
35
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
10
-
52
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
21
8
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
10
19
-
-
53
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
33
17
-
-
46
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]
or, a permutation matrix of a code length of 648:
[
26
-
-
3
-
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
19
-
-
24
-
8
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
13
-
1
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
1
-
14
-
4
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
21
-
-
16
-
3
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
7
-
-
9
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
19
-
-
19
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
11
-
4
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
12
-
20
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
1
23
-
-
-
-
0
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
25
-
-
-
5
5
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
13
-
-
-
-
23
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
1
-
19
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
5
-
-
8
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
8
20
-
6
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
12
-
24
21
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
0
-
-
-
-
14
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
3
20
-
13
-
-
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]

### Claim 6 (depends on 1)

The channel coding method according to claim 1, wherein the permutation matrix for 1/3 code rate comprises:
a permutation matrix of a code length of 1944:
[
37
-
19
46
70
-
-
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
49
-
-
75
-
-
-
0
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
18
-
-
13
-
-
8
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
76
-
65
-
-
-
5
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
29
-
-
27
-
-
-
26
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
46
10
-
47
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
29
-
-
57
-
29
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
46
10
-
47
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
20
-
-
57
-
29
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
79
-
-
-
60
3
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
78
74
-
-
0
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
60
-
-
20
-
-
-
59
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
69
-
-
30
-
-
-
16
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
10
-
-
13
-
-
24
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
31
59
-
54
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
33
57
-
76
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
56
-
-
50
-
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
65
53
-
24
-
-
-
-
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]
a permutation matrix of a code length of 1296:
[
47
-
-
14
43
-
-
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
41
-
-
-
4
-
-
30
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
11
-
-
4
-
24
-
46
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
41
-
5
-
-
-
-
5
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
42
26
12
-
24
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
31
-
-
50
2
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
19
-
-
46
37
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
52
17
-
22
47
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
0
50
-
-
-
21
-
-
0
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
23
-
28
-
-
9
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
45
-
-
37
44
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
27
-
-
34
37
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
4
-
-
0
-
-
-
4
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
6
-
-
5
32
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
49
-
-
-
-
12
-
52
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
15
-
-
46
22
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]
or, a permutation matrix of a code length of 648:
[
-
18
-
3
25
-
-
-
1
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
23
-
-
24
-
-
22
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
-
18
-
26
-
-
-
1
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
-
-
25
0
-
-
23
22
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
13
5
-
0
-
-
-
16
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
-
-
17
5
13
22
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
12
24
-
15
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
-
26
-
23
9
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
-
7
-
17
-
-
20
-
0
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
-
12
-
6
-
-
-
10
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
-
15
16
3
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
-
23
-
22
-
-
-
20
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
-
-
14
-
18
-
-
-
19
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
-
7
22
-
-
7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
21
23
-
-
-
20
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
0
-
2
-
11
18
-
-
-
1
-
-
-
-
-
-
-
-
-
-
-
-
-
-
0
]

### Claim 7

A processing device for channel coding, comprising:
a receiving unit, configured to receive a code stream; and
a processing unit, configured to channel-encode or channel-decode a code stream by using a generating matrix or a check matrix of QC-LDPC codes, wherein
a code rate of the generating matrix or the check matrix is 1/6, 1/4 or 1/3.

### Claim 8 (depends on 7)

The channel coding device according to claim 7, wherein a total weight range of the permutation matrix is from 79 to 88;
for 1/6 code rate, the row weight of each row in the base matrix is equal to 5 or 4;
for 1/4 code rate, the row weight of each row in the base matrix is equal to 5; and
for 1/3 code rate, the row weight of each row in the base matrix is equal to 6 or 5.

### Claim 9

A processing device for channel coding, comprising:
a processing unit; and
a memory, on which one or more computer program modules are stored;
wherein when the one or more computer program modules are configured to be executed by the processing unit, a channel coding method is implemented, and
the channel coding method, comprising:
using a generating matrix or a check matrix of QC-LDPC codes to channel-encode or channel-decode a code stream, wherein
a code rate of the generating matrix or the check matrix is 1/6, 1/4 or 1/3.
