IP Library › Granted Patent US 11,671,116
Granted Patent B2
US 11,671,116 · App. 17/591,347 · Granted Jun 6, 2023

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

Inventors: Jie Jin (Shenzhen, CN); Ivan Leonidovich Mazurenko (Moscow, RU); Aleksandr Aleksandrovich Petiushko (Moscow, RU); Chaolong Zhang (Hangzhou, CN)
Assignee: Huawei Technologies Co., Ltd.
H03M13/255H03M13/1174H03M13/616H03M13/6362
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,671,116
App. No.
17/591,347
Granted
Jun 6, 2023
Kind
B2
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 (455)

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

determine a lifting factor Z; and

encode an input sequence based on a low density parity check (LDPC) matrix,

wherein the LDPC matrix is identified based on a matrix H B and the lifting factor Z, and wherein non-zero-elements of the matrix H B whose row indexes (i), column indexes (j), and corresponding values are as follows:

matrix H B

row

indexes (i)

column indexes (j)

V i, 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.

2. The apparatus according to claim 1 , wherein the at least one processor is configured to:

determine the matrix H B according to a set index of the lifting factor Z.

3. The apparatus according to claim 1 , wherein the lifting factor Z is determined based on following sets of lifting factors, wherein each of the sets of lifting factors is identified by a set index:

{2, 4, 8, 16, 32, 64, 128, 256};

{3, 6, 12, 24, 48, 96, 192, 384};

{5, 10, 20, 40, 80, 160, 320};

{7, 14, 28, 56, 112, 224};

{9, 18, 36, 72, 144, 288};

{11, 22, 44, 88, 176, 352};

{13, 26, 52, 104, 208}; and

{15, 30, 60, 120, 240}.

4. The apparatus according to claim 1 , wherein the lifting factor Z is one of 5, 10, 20, 40, 80, 160 and 320.

5. The apparatus according to claim 1 , wherein all elements except the non-zero-elements in the matrix H B are zero elements.

6. The apparatus according to claim 5 , wherein the LDPC matrix is identified based on the matrix H B by replacing the zero-elements of the matrix H B with all zero matrices of size Z×Z, and replacing the non-zero-elements of the matrix H B with circular permutation matrices.

7. The apparatus according to claim 6 , wherein each circular permutation matrix respectively corresponds to a Z×Z identity matrix circularly shifted to the right for P i,j times, wherein P i,j =mod(V i,j ,Z).

8. The apparatus according to claim 1 , comprising at least one memory configured to store one or more of the following:

parameters associated with the matrix H B ;

the matrix H B ;

the lifting factor Z; or

a transformed matrix of the matrix H B .

9. The apparatus according to claim 1 , comprising a transceiver configured to:

receive a signal,

wherein the at least one processor is configured to decode the signal based on the matrix H B .

10. A method for wireless communication, comprising:

determining a lifting factor Z; and

encoding an input sequence based on a low density parity check (LDPC) matrix,

wherein the LDPC matrix is identified based on a matrix H B and the lifting factor Z, and wherein non-zero-elements of the matrix H B whose row indexes (i), column indexes (j), and corresponding values V i,j are as follows:

matrix H B

row

indexes (i)

column indexes (j)

V i, 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.

11. The method according to claim 10 , further comprising:

determining the matrix H B according to a set index of the lifting factor Z.

12. The method according to claim 10 , wherein the lifting factor Z is determined based on following sets of lifting factors, wherein each of the sets of lifting factors is identified by a set index:

{2, 4, 8, 16, 32, 64, 128, 256};

{3, 6, 12, 24, 48, 96, 192, 384};

{5, 10, 20, 40, 80, 160, 320};

{7, 14, 28, 56, 112, 224};

{9, 18, 36, 72, 144, 288};

{11, 22, 44, 88, 176, 352};

{13, 26, 52, 104, 208}; and

{15, 30, 60, 120, 240}.

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

14. The method according to claim 10 , wherein all elements except the non-zero-elements in the matrix H B are zero elements.

15. The method according to claim 14 , wherein the LDPC matrix is identified based on the matrix H B by replacing the zero-elements of the matrix H B with all zero matrices of size Z×Z, and replacing the non-zero-elements of the matrix H B with circular permutation matrices.

16. The method according to claim 15 , wherein each circular permutation matrix respectively corresponds to a Z×Z identity matrix circularly shifted to the right for P i,j times, wherein P i,j =mod(V i,j ,Z).

17. The method according to claim 10 , further comprising:

receiving a signal; and

decoding the signal based on the matrix H B .

18. A computer-readable storage medium having instructions stored thereon that, when executed by a processor, cause a computer to perform a process that comprises:

determining a lifting factor Z; and

encoding an input sequence based on a low density parity check (LDPC) matrix,

wherein the LDPC matrix is identified based on a matrix H B and the lifting factor Z, and wherein non-zero-elements of the matrix H B whose row indexes (i), column indexes (j), and corresponding values V1, are as follows:

matrix H B

row

indexes (i)

column indexes (j)

V i, 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.

19. The computer-readable storage medium according to claim 18 , wherein the lifting factor Z is one of 5, 10, 20, 40, 80, 160 and 320.

20. The computer-readable storage medium according to claim 19 , wherein the computer-readable storage medium is configured to store one or more of the following:

parameters associated with the matrix H B ;

the matrix H B ;

the lifting factor Z; or

a transformed matrix of the matrix H B .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 2, 2022
From: JIN, JIE; MAZURENKO, IVAN LEONIDOVICH; PETIUSHKO, ALEKSANDR ALEKSANDROVICH; ZHANG, CHAOLONG
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 058866/0285 →
Priority Claims (2)
CN 201710503056.2 · Jun 27, 2017 · national
CN 201710572364.0 · Jul 13, 2017 · national
Continuity (4)
Continuation 17013640 · Sep 6, 2020
Continuation 16423175 · May 28, 2019
Continuation PCTCN2018082851 · Apr 12, 2018
Related Publication 20220231705A1 · Jul 21, 2022
Cited By (2)
US 12,301,255 US 12,726,217