IP Library › Granted Patent US 11,082,061
Granted Patent B2
US 11,082,061 · App. 16/559,027 · Granted Aug 3, 2021

High-rate long LDPC codes

Inventors: Guido Montorsi (Turin, IT); Sergio Benedetto (Turin, IT); Yan Xin (Ottawa, CA); Min Yan (Shenzhen, CN)
Assignee: Huawei Technologies Co., Ltd.
H03M13/1157H03M13/1174H03M13/1575H03M13/616
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,082,061
App. No.
16/559,027
Granted
Aug 3, 2021
Kind
B2
Abstract

Methods and devices for encoding source words and decoding codewords wherein encoding a source word includes: receiving a 1×K source word row vector ū; and generating a 1×N codeword vector c =ū·G, wherein G is a K×N generator matrix derived from a parity check matrix H I ; and wherein the parity check matrix H I is derived from a base parity check matrix H by applying an optimized lifting matrix to the base parity check matrix H.

Claims (354)

1. A method for encoding a source word, comprising:

receiving a 1×K source word row vector ū; and

generating a 1×N codeword vector c =ū·G, wherein

G is a K×N generator matrix derived from a parity check matrix H I ; and

wherein H I is derived from a base parity check matrix H by applying an optimized lifting matrix to the base parity check matrix H, the optimized lifting matrix being either:

1

1

0

0

0

0

0

1

1

0

1

0

0

1

0

0

1

1

1

1

1

1

1

1

0

1

1

0

0

1

1

1

1

1

0

0

1

0

1

0

1

0

1

1

0

0

0

0

0

0

0

1

0

0

0

0

or

0

0

0

0

1

1

0

0

0

1

0

0

1

1

1

0

0

1

0

1

0

1

0

0

0

0

1

0

1

1

0

1

1

0

0

1

0

0

0

1

0

0

1

0

1

0

0

0

0

0

0

0

0

0

0

1.

2. The method of claim 1 wherein different rows in the base parity check matrix are summed to obtain H I .

3. The method of claim 2 wherein rows 1 and 3 of the intermediate base parity check matrix are summed.

4. The method of claim 2 wherein rows 2 and 4 of the intermediate base parity check matrix are summed.

5. The method of claim 1 wherein H I is:

37

35

31

19

41

18

22

23

40

11

41

21

39

6

20

6

32

28

18

35

37

19

31

18

41

23

22

11

40

21

41

6

39

6

20

28

32

9

25

29

30

22

0

4

34

8

31

33

3

22

14

17

15

4

4

27

29

25

22

30

4

0

8

34

33

31

22

3

17

14

4

15

27

4

28

 9

12

17

3

29

28

0

13

18

17

12

29

3

28

0

13

28

14

20

27

18

13

24

13

23

22

24

20

14

18

27

24

13

23

13

22

24.

6. A system, comprising:

a processor

a non-transitory memory connected to the processor and storing instructions configuring the processor to cause the system to perform the method of:

receiving a 1×K source word row vector ū; and

generating a 1×N codeword vector c =ū·G, wherein

G is a K×N generator matrix derived from a parity check matrix H I ; and

wherein H I is derived from a base parity check matrix H by applying an optimized lifting matrix to the base parity check matrix H I the optimized lifting matrix being either:

1

1

0

0

0

0

0

1

1

0

1

0

0

1

0

0

1

1

1

1

1

1

1

1

0

1

1

0

0

1

1

1

1

1

0

0

1

0

1

0

1

0

1

1

0

0

0

0

0

0

0

1

0

0

0

0

or:

0

0

0

0

1

1

0

0

0

1

0

0

1

1

1

0

0

1

0

1

0

1

0

0

0

0

1

0

1

1

0

1

1

0

0

1

0

0

0

1

0

0

1

0

1

0

0

0

0

0

0

0

0

0

0

1

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 31, 2019
From: MONTORSI, GUIDO; BENEDETTO, SERGIO; YAN, MIN; XIN, YAN
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 050879/0585 →
Continuity (2)
Continuation PCTCN2017075616 · Mar 3, 2017
Related Publication 20190393890A1 · Dec 26, 2019