US 12,726,217 B2Granted

Method and apparatus for low density parity check channel coding in wireless communication system

AssigneeHuawei Technologies Co., Ltd.

InventorsJie Jin, Ivan Leonidovich Mazurenko, Aleksandr Aleksandrovich Petiushko, Chaolong Zhang

Life of this patent

Estimating the term…

Loading patent…

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.

Claims29

Dependent claims

An apparatus for wireless communication, the apparatus comprising at least one processor configured to:

determine a lifting factor Z;
and
perform low density parity check (LDPC) encoding/decoding on an input sequence based on the lifting factor Z and a base matrix;
wherein elements in the base matrix are respectively represented by their row index i and column index j, each element in base matrix represents either an all zero matrix of size Z×Z or a circular permutation matrix hi,j of size Z×Z;
wherein, for each element in the base matrix that does not represent an all zero matrix, an element at row index i and column index j in the base matrix represents a circular permutation matrix hi,j of size Z×Z and is associated with a value Vi,j, and the value of Vi,j and associated row index i and column index j are given below:
row
indexes (i)
column indexes (j)
Vi, j
0
0, 1, 2, 3, 6, 9, 10, 11
0, 0, 0, 0, 0, 0, 0, 0
1
0, 3, 4, 5, 6, 7, 8, 9, 11, 12
137, 124, 0, 0, 88, 0, 0, 55, 0, 0
2
0, 1, 3, 4, 8, 10, 12, 13
20, 94, 99, 9, 108, 1, 0, 0
3
1, 2, 4, 5, 6, 7, 8, 9, 10, 13
38, 15, 102, 146, 12, 57, 53,
46, 0, 0
4
0, 1, 11, 14
0, 136, 157, 0
5
0, 1, 5, 7, 11, 15
0, 131, 142, 141, 64, 0
6
0, 5, 7, 9, 11, 16
0, 124, 99, 45, 148, 0
7
1, 5, 7, 11, 13, 17
0, 45, 148, 96, 78, 0
8
0, 1, 12, 18
0, 65, 87, 0
9
1, 8, 10, 11, 19
0, 97, 51, 85, 0
10
0, 1, 6, 7, 20
0, 17, 156, 20, 0
11
0, 7, 9, 13, 21
0, 7, 4, 2, 0
12
1, 3, 11, 22
0, 113, 48, 0
13
0, 1, 8, 13, 23
0, 112, 102, 26, 0
14
1, 6, 11, 13, 24
0, 138, 57, 27, 0
15
0, 10, 11, 25
0, 73, 99, 0
16
1, 9, 11, 12, 26
0, 79, 111, 143, 0
17
1, 5, 11, 12, 27
0, 24, 109, 18, 0
18
0, 6, 7, 28
0, 18, 86, 0
19
0, 1, 10, 29
0, 158, 154, 0
20
1, 4, 11, 30
0, 148, 104, 0
21
0, 8, 13, 31
0, 17, 33, 0
22
1, 2, 32
0, 4, 0
23
0, 3, 5, 33
0, 75, 158, 0
24
1, 2, 9, 34
0, 69, 87, 0
25
0, 5, 35
0, 65, 0
26
2, 7, 12, 13, 36
0, 100, 13, 7, 0
27
0, 6, 37
0, 32, 0
28
1, 2, 5, 38
0, 126, 110, 0
29
0, 4, 39
0, 154, 0
30
2, 5, 7, 9, 40
0, 35, 51, 134, 0
31
1, 13, 41
0, 20, 0
32
0, 5, 12, 42
0, 20, 122, 0
33
2, 7, 10, 43
0, 88, 13, 0
34
0, 12, 13, 44
0, 19, 78, 0
35
1, 5, 11, 45
0, 157, 6, 0
36
0, 2, 7, 46
0, 63, 82, 0
37
10, 13, 47
0, 144, 0
38
1, 5, 11, 48
0, 93, 19, 0
39
0, 7, 12, 49
0, 24, 138, 0
40
2, 10, 13, 50
0, 36, 143, 0
41
1, 5, 11, 51
0, 2, 55, 0.

133 more elements

A method, comprising:

determining a lifting factor Z;
and
performing low density parity check (LDPC) encoding/decoding on an input sequence based on the lifting factor Z and a base matrix;
wherein elements in the base matrix are respectively represented by their row index i and column index j, each element in base matrix represents either an all zero matrix of size Z×Z or a circular permutation matrix hi,j of size Z×Z;
wherein, for each element in the base matrix that does not represent an all zero matrix, an element at row index i and column index j in the base matrix represents a circular permutation matrix hi,j of size Z×Z and is associated with a value Vi,j, and the value of Vi,j and associated row index i and column index j are given below:
row
indexes (i)
column indexes (j)
Vi, j
0
0, 1, 2, 3, 6, 9, 10, 11
0, 0, 0, 0, 0, 0, 0, 0
1
0, 3, 4, 5, 6, 7, 8, 9, 11, 12
137, 124, 0, 0, 88, 0, 0, 55, 0, 0
2
0, 1, 3, 4, 8, 10, 12, 13
20, 94, 99, 9, 108, 1, 0, 0
3
1, 2, 4, 5, 6, 7, 8, 9, 10, 13
38, 15, 102, 146, 12, 57, 53,
46, 0, 0
4
0, 1, 11, 14
0, 136, 157, 0
5
0, 1, 5, 7, 11, 15
0, 131, 142, 141, 64, 0
6
0, 5, 7, 9, 11, 16
0, 124, 99, 45, 148, 0
7
1, 5, 7, 11, 13, 17
0, 45, 148, 96, 78, 0
8
0, 1, 12, 18
0, 65, 87, 0
9
1, 8, 10, 11, 19
0, 97, 51, 85, 0
10
0, 1, 6, 7, 20
0, 17, 156, 20, 0
11
0, 7, 9, 13, 21
0, 7, 4, 2, 0
12
1, 3, 11, 22
0, 113, 48, 0
13
0, 1, 8, 13, 23
0, 112, 102, 26, 0
14
1, 6, 11, 13, 24
0, 138, 57, 27, 0
15
0, 10, 11, 25
0, 73, 99, 0
16
1, 9, 11, 12, 26
0, 79, 111, 143, 0
17
1, 5, 11, 12, 27
0, 24, 109, 18, 0
18
0, 6, 7, 28
0, 18, 86, 0
19
0, 1, 10, 29
0, 158, 154, 0
20
1, 4, 11, 30
0, 148, 104, 0
21
0, 8, 13, 31
0, 17, 33, 0
22
1, 2, 32
0, 4, 0
23
0, 3, 5, 33
0, 75, 158, 0
24
1, 2, 9, 34
0, 69, 87, 0
25
0, 5, 35
0, 65, 0
26
2, 7, 12, 13, 36
0, 100, 13, 7, 0
27
0, 6, 37
0, 32, 0
28
1, 2, 5, 38
0, 126, 110, 0
29
0, 4, 39
0, 154, 0
30
2, 5, 7, 9, 40
0, 35, 51, 134, 0
31
1, 13, 41
0, 20, 0
32
0, 5, 12, 42
0, 20, 122, 0
33
2, 7, 10, 43
0, 88, 13, 0
34
0, 12, 13, 44
0, 19, 78, 0
35
1, 5, 11, 45
0, 157, 6, 0
36
0, 2, 7, 46
0, 63, 82, 0
37
10, 13, 47
0, 144, 0
38
1, 5, 11, 48
0, 93, 19, 0
39
0, 7, 12, 49
0, 24, 138, 0
40
2, 10, 13, 50
0, 36, 143, 0
41
1, 5, 11, 51
0, 2, 55, 0.

133 more elements

A non-transitory computer-readable storage medium having instructions stored thereon that, when executed by a processor, cause at least one processor to perform a process that comprises:

determining a lifting factor Z;
and
performing low density parity check (LDPC) encoding/decoding on an input sequence based on the lifting factor Z and a base matrix;
wherein elements in the base matrix are respectively represented by their row index i and column index j, each element in base matrix represents either an all zero matrix of size Z×Z or a circular permutation matrix hi,j of size Z×Z;
wherein, for each element in the base matrix that does not represent an all zero matrix, an element at row index i and column index j in the base matrix represents a circular permutation matrix hi,j of size Z×Z and is associated with a value Vi,j, and the value of Vi,j and associated row index i and column index j are given below:
row
indexes (i)
column indexes (j)
Vi, j
0
0, 1, 2, 3, 6, 9, 10, 11
0, 0, 0, 0, 0, 0, 0, 0
1
0, 3, 4, 5, 6, 7, 8, 9, 11, 12
137, 124, 0, 0, 88, 0, 0, 55, 0, 0
2
0, 1, 3, 4, 8, 10, 12, 13
20, 94, 99, 9, 108, 1, 0, 0
3
1, 2, 4, 5, 6, 7, 8, 9, 10, 13
38, 15, 102, 146, 12, 57, 53,
46, 0, 0
4
0, 1, 11, 14
0, 136, 157, 0
5
0, 1, 5, 7, 11, 15
0, 131, 142, 141, 64, 0
6
0, 5, 7, 9, 11, 16
0, 124, 99, 45, 148, 0
7
1, 5, 7, 11, 13, 17
0, 45, 148, 96, 78, 0
8
0, 1, 12, 18
0, 65, 87, 0
9
1, 8, 10, 11, 19
0, 97, 51, 85, 0
10
0, 1, 6, 7, 20
0, 17, 156, 20, 0
11
0, 7, 9, 13, 21
0, 7, 4, 2, 0
12
1, 3, 11, 22
0, 113, 48, 0
13
0, 1, 8, 13, 23
0, 112, 102, 26, 0
14
1, 6, 11, 13, 24
0, 138, 57, 27, 0
15
0, 10, 11, 25
0, 73, 99, 0
16
1, 9, 11, 12, 26
0, 79, 111, 143, 0
17
1, 5, 11, 12, 27
0, 24, 109, 18, 0
18
0, 6, 7, 28
0, 18, 86, 0
19
0, 1, 10, 29
0, 158, 154, 0
20
1, 4, 11, 30
0, 148, 104, 0
21
0, 8, 13, 31
0, 17, 33, 0
22
1, 2, 32
0, 4, 0
23
0, 3, 5, 33
0, 75, 158, 0
24
1, 2, 9, 34
0, 69, 87, 0
25
0, 5, 35
0, 65, 0
26
2, 7, 12, 13, 36
0, 100, 13, 7, 0
27
0, 6, 37
0, 32, 0
28
1, 2, 5, 38
0, 126, 110, 0
29
0, 4, 39
0, 154, 0
30
2, 5, 7, 9, 40
0, 35, 51, 134, 0
31
1, 13, 41
0, 20, 0
32
0, 5, 12, 42
0, 20, 122, 0
33
2, 7, 10, 43
0, 88, 13, 0
34
0, 12, 13, 44
0, 19, 78, 0
35
1, 5, 11, 45
0, 157, 6, 0
36
0, 2, 7, 46
0, 63, 82, 0
37
10, 13, 47
0, 144, 0
38
1, 5, 11, 48
0, 93, 19, 0
39
0, 7, 12, 49
0, 24, 138, 0
40
2, 10, 13, 50
0, 36, 143, 0
41
1, 5, 11, 51
0, 2, 55, 0.

133 more elements

Dependencies are inferred from the claim text.

Facts

Application: 18/780,071Filed 22 Jul 2024 · continuation
Priority: CN 201710503056.227 Jun 2017
Published: US 2025/0015815 A19 Jan 2025
Granted: 1 Sep 2026
Term ends: Not estimatedThe source records don’t support an estimate.

Classification11 codes

H03M 13/116
Structural properties of the code parity-check or generator matrix: quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed…
H03M 13/255
Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded…: with…
H03M 13/1174
Structural properties of the code parity-check or generator matrix: parity-check or generator matrices built from sub-matrices representing known…
H03M 13/1185
Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure: wherein the…

Family

PCT/CN2018/082851Parent of this continuation · filed 12 Apr 2018
Application16/423,175Parent of this continuation · filed 28 May 2019
Application17/013,640Parent of this continuation · filed 6 Sep 2020
US 10,771,092 B2Parent of this continuation · filed 8 Sep 2020
Application17/591,347Parent of this continuation · filed 2 Feb 2022
US 11,277,153 B2Parent of this continuation · filed 15 Mar 2022
Application18/305,982Parent of this continuation · filed 24 Apr 2023
US 11,671,116 B2Parent of this continuation · filed 6 Jun 2023
US 2025/0015815 A1Pre-grant publication · published 9 Jan 2025
US 12,047,096 B2Parent of this continuation
US 2020/0052720 A1Published application
US 2021/0058095 A1Published application
US 2022/0231705 A1Published application
US 2023/0361787 A1Published application
US 12,726,217 B2This patent

From the US filing history. Foreign family members aren’t listed.