IP Library Granted Patent US 12,556,201
Granted Patent B2
US 12,556,201 · App. 18/647,738 · Granted Feb 17, 2026

System and method for low density parity check (LDPC) code with 1/2 code rate

Inventors: Rethnakaran Pulikkoonattu (San Diego, CA); Andrew Blanksby (Irvine, CA); Vinko Erceg (San Diego, CA)
Assignee: Avago Technologies International Sales Pte. Limited
H03M13/255H03M13/036H03M13/116H03M13/616H04L1/0002H04L1/0041H04L1/0045H04L1/0057H03M13/1188
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 12,556,201
App. No.
18/647,738
Filed
Apr 26, 2024
Granted
Feb 17, 2026
Kind
B2
Art Unit
2111
USPC
714/776
Abstract

In some implementations, an apparatus may include a transmitter and one or more processors. The one or more processors may be configured to identify, according to a code rate of 1/2 and a code block size of 3888 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code. The first binary parity check matrix may correspond to a first exponent matrix having 288 values. The one or more processors may be configured to encode data using the first binary parity check matrix. The one or more processors may be configured to transmit the encoded data.

Claims (51)

1 . A method, comprising:

identifying, by baseband circuitry of a first device according to a code rate of 1/2 and a code block size of 3888 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code, the first binary parity check matrix corresponding to a first exponent matrix having 288 values;

generating the first exponent matrix by selecting at least 286 values from a second exponent matrix having the same dimensions as dimensions of the first exponent matrix by shifting one or two values of the first exponent matrix from one or more corresponding positive values of the second exponent matrix by −1 or +1;

encoding, by an encoder of the baseband circuitry of the first device, data using the first binary parity check matrix; and

transmitting, by a transmitter of the first device, the encoded data over a channel to increase a gain in a signal-to-noise (SNR) of the channel compared with encoding data using a QC-LDPC code with a code block size of less than 3888 bits.

2 . The method of claim 1 ,

wherein the one or more corresponding positive values of the second exponent matrix are not selected as the at least 286 values.

3 . The method of claim 1 , wherein the second exponent matrix comprises the following set of values: [115 −1 −1 −1 101 −1 23 −1 100 −1 158 −1 20 −1 −1 −1 −1 −1 −1 −16 −1 57 −1 −1 −1 −1 −1 110 15 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 −1 −1 60 −1 −1 −1 49 74 −1 −1 112 29 −1 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 −1 124 106 −1 −1 107 −1 −1 6 70 −1 −1 −1 −1 −1 −1 00 −1 −1 −1 −1 −1 −1 −1 81 −1 −1 40 133 −1 −1 45 57 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 −10 −1 −1 −1 17 −1 84 −1 101 −1 −1 17 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 139 158 159 −1 −1 −1 112 −1 105 −1 −1 −10 −1 −1 −1 −1 −100 −1 −1 −1 −1 131 −1 −1 −1 77 114 −1 −1 145 −1 55 −1 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 129 −1 −1 −1 28 105 −1 −1 61 −1 −1 65 −1 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 90 −1 141 1 −1 −1 −1 155 18 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −100 −1 4 112 −1 135 70 −1 −1 −1 −1 −1 25 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −10 0 49 −1 123 −1 121 −1 −1 54 102 −1 −1 32 2 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 0].

4 . The method of claim 1 , further comprising:

identifying a second binary parity check matrix in which one or more columns of the first binary parity check matrix are permuted, the second binary parity check matrix having the same dimensions as dimensions of the first binary parity check matrix; and

encoding, by the one or more processors, data using the second binary parity check matrix.

5 . The method of claim 1 , further comprising:

identifying a third binary parity check matrix corresponding to a second exponent matrix in which one or more columns of the first exponent matrix are permuted, the second exponent matrix having the same dimensions as dimensions of the first exponent matrix; and

encoding, by the one or more processors, data using the third binary parity check matrix.

6 . The method of claim 1 , further comprising:

generating the first binary parity check matrix using (1) a matrix product of the first binary parity check matrix and the first exponent matrix, or (2) a matrix product of the first exponent matrix and the first binary parity check matrix.

7 . The method of claim 1 , further comprising:

identifying, by a second device, the first binary parity check matrix;

receiving, by the second device from the first device, the encoded data; and

decoding, by the second device, the encoded data using the first binary parity check matrix.

8 . An apparatus comprising:

a transmitter and baseband circuitry, wherein the baseband circuitry is configured to:

identify, according to a code rate of 1/2 and a code block size of 3888 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code, the first binary parity check matrix corresponding to a first exponent matrix having 288 values;

encode, by an encoder of the baseband circuitry, data using the first binary parity check matrix; and

transmit the encoded data over a channel to increase a gain in a signal-to-noise (SNR) of the channel compared with encoding data using the first QC-LDPC code,

wherein the first exponent matrix comprises the following set of values: [115 −1 −1 −1 101 −1 23 −1 100 −1 158 −1 20 −1 −1 −1 −1 −1 −1 −1 6 −1 57 −1 −1 −1 −1 −1 110 15 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 −1 −1 60 −1 −1 −1 49 74 −1 −1 112 29 −1 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 −1 124 106 −1 −1 107 −1 −1 6 70 −1 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 81 −1 −1 40 133 −1 −1 45 57 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 −10 −1 −1 −1 17 −1 84 −1 101 −1 −1 17 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 139 158 159 −1 −1 −1 112 −1 105 −1 −1 −10 −1 −1 −1 −1 −100 −1 −1 −1 −1 131 −1 −1 −1 77 114 −1 −1 145 −1 55 −1 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 129 −1 −1 −1 28 105 −1 −1 61 −1 −1 65 −1 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 90 −1 141 1 −1 −1 −1 155 18 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 0 0 −1 4 112 −1 135 70 −1 −1 −1 −1 −1 25 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −100 49 −1 123 −1 121 −1 −1 54 102 −1 −1 32 2 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 0].

9 . The apparatus of claim 8 , wherein the one or more processors are further configured to:

generate the first exponent matrix by selecting at least 286 values from a second exponent matrix having the same dimensions as dimensions of the first exponent matrix.

10 . The apparatus of claim 9 , wherein the one or more processors are further configured to:

shift one or two values of the first exponent matrix from one or more corresponding positive values of the second exponent matrix by −1 or +1,

wherein the one or more corresponding positive values of the second exponent matrix are not selected as the at least 286 values.

11 . The apparatus of claim 8 , wherein the one or more processors are further configured to:

identify a second binary parity check matrix in which one or more columns of the first binary parity check matrix are permuted, the second binary parity check matrix having the same dimensions as dimensions of the first binary parity check matrix; and

encode data using the second binary parity check matrix.

12 . The apparatus of claim 8 , wherein the one or more processors are further configured to:

identify a third binary parity check matrix corresponding to a second exponent matrix in which one or more columns of the first exponent matrix are permuted, the second exponent matrix having the same dimensions as dimensions of the first exponent matrix; and

encode data using the third binary parity check matrix.

13 . The apparatus of claim 8 , wherein the one or more processors are further configured to:

generate the first binary parity check matrix using (1) a matrix product of the first binary parity check matrix and the first exponent matrix, or (2) a matrix product of the first exponent matrix and the first binary parity check matrix.

14 . An apparatus comprising:

a receiver configured to receive encoded data over a channel wherein the data is encoded using a first quasi-cyclic-low-density parity-check (QC-LDPC) code with a code block size of 3888 bits to increase a gain in a signal-to-noise (SNR) of the channel compared with encoding data using a QC-LDPC code with a code block size of less than 3888 bits; and

the baseband circuitry is configured to:

identify, according to a code rate of 1/2 and the code block size of 3888 bits, a first binary parity check matrix for the first QC-LDPC code, the first binary parity check matrix corresponding to a first exponent matrix having 288 values; and

decode, by a decoder of the baseband circuitry, the received encoded data using the first binary parity check matrix,

wherein the first exponent matrix comprises the following set of values: [115 −1 −1 −1 101 −1 23 −1 100 −1 158 −1 20 −1 −1 −1 −1 −1 −1 −1 6 −1 57 −1 −1 −1 −1 −1 110 15 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 −1 −1 60 −1 −1 −1 49 74 −1 −1 112 29 −1 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 −1 124 106 −1 −1 107 −1 −1 6 70 −1 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 −1 −1 81 −1 −1 40 133 −1 −1 45 57 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 −10 −1 −1 −1 17 −1 84 −1 101 −1 −1 17 −1 −1 −1 −1 −100 −1 −1 −1 −1 −1 139 158 159 −1 −1 −1 112 −1 105 −1 −1 −10 −1 −1 −1 −1 −100 −1 −1 −1 −1 131 −1 −1 −1 77 114 −1 −1 145 −1 55 −1 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 129 −1 −1 −1 28 105 −1 −1 61 −1 −1 65 −1 −1 −1 −1 −1 −1 −1 −100 −1 −1 −1 90 −1 141 1 −1 −1 −1 155 18 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 −1 00 −1 4 112 −1 135 70 −1 −1 −1 −1 −1 25 −1 −1 −1 −1 −1 −1 1 −1 −1 −1 −10049 −1 123 −1 121 −1 −1 54 102 −1 −1 32 2 −1 −1 −1 −1 −1 −1 −1 −1 −1 −10].

15 . The apparatus of claim 14 , wherein the first exponent matrix comprises at least 286 values selected from a second exponent matrix having the same dimensions as dimensions of the first exponent matrix.

16 . The apparatus of claim 15 , wherein the first exponent matrix comprises one or two values shifted from one or more corresponding positive values of the second exponent matrix by −1 or +1,

wherein the one or more corresponding positive values of the second exponent matrix are not selected as the at least 286 values.

17 . The apparatus of claim 14 , wherein the one or more processors are further configured to:

identify a second binary parity check matrix in which one or more columns of the first binary parity check matrix are permuted, the second binary parity check matrix having the same dimensions as dimensions of the first binary parity check matrix; and

decode the received encoded data using the second binary parity check matrix.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 20, 2024
From: PULIKKOONATTU, RETHNAKARAN; BLANKSBY, ANDREW; ERCEG, VINKO
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 067468/0584 →
Continuity (5)
Provisional Application 63600331 · Nov 17, 2023
Provisional Application 63600327 · Nov 17, 2023
Provisional Application 63516700 · Jul 31, 2023
Provisional Application 63516688 · Jul 31, 2023
Related Publication 20250047308A1 · Feb 6, 2025
References Cited (27)
US 10972134B2 · Strobel et al. · 2021 [cited by applicant]
US 20080022191A1 · Stolpman et al. · 2008 [cited by applicant]
US 20130311846A1 · Li et al. · 2013 [cited by applicant]
US 20140157079A1 · Park et al. · 2014 [cited by applicant]
US 20160211941A1 · Shen et al. · 2016 [cited by applicant]
US 20160380722A1 · Hassanin · 2016 [cited by examiner]
US 20170149528A1 · Kim et al. · 2017 [cited by applicant]
US 20170187489A1 · Myung · 2017 [cited by examiner]
US 20180287632A1 · Rom et al. · 2018 [cited by applicant]
US 20190334652A1 · Myung · 2019 [cited by examiner]
US 20210211143A1 · Richardson et al. · 2021 [cited by applicant]
US 20220077874A1 · Myung · 2022 [cited by examiner]
US 20220294474A1 · Motwani et al. · 2022 [cited by applicant]
US 20230253984A1 · Jang · 2023 [cited by examiner]
US 20240120949A1 · Morero et al. · 2024 [cited by applicant]
US 20250047308A1 · Pulikkoonattu · 2025 [cited by examiner]
EP 3540948A1 · 2019 [cited by examiner]
EP 3582398B1 · 2022 [cited by applicant]
Mahdi et al., On the Encoding Complexity of Quasi-Cyclic LDPC Codes, Nov. 15, 2015, IEEE, vol. 63, No. 22, pp. 6096-6108. (Year: 2015). [cited by examiner]
European Office Action on Appln. No. 24190405.1 dated Aug. 28, 2025. [cited by applicant]
European Office Action on Appln. No. 24191478.7 dated Aug. 28, 2025. [cited by applicant]
European Office Action on Appln. No. 24191490.2 dated Aug. 28, 2025. [cited by applicant]
Non-Final Office Action on U.S. Appl. No. 18/647,699 DTD Aug. 7, 2025. [cited by applicant]
Non-Final Office Action on U.S. Appl. No. 18/647,710 DTD Jun. 5, 2025. [cited by applicant]
Final Office Action on U.S. Appl. No. 18/647,699 DTD Nov. 26, 2025. [cited by applicant]
H. Wu and H. Wang, “A High Throughput Implementation of QC—LDPC Codes for 5G NR,” in IEEE Access, vol. 7, p. 185373- 185384, 2019, (Year: 2019). [cited by applicant]
Non-Final Office Action on U.S. Appl. No. 18/647,759 DTD Dec. 18, 2025. [cited by applicant]