IP Library Granted Patent US 12,362,770
Granted Patent B2
US 12,362,770 · App. 17/680,062 · Granted Jul 15, 2025

Load balanced decoder systems and methods

Inventors: Spanta Ashjaee (San Jose, CA); Gee Hang Lui (San Jose, CA); Jiun-Yee Lin (San Jose, CA)
Assignee: Altera Corporation
H03M13/3707H03M13/116
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,362,770
App. No.
17/680,062
Granted
Jul 15, 2025
Kind
B2
Abstract

A decoding circuit system includes a load balancing scheduler circuit, a full range decoder circuit, and an auxiliary decoder circuit. The load balancing scheduler circuit provides codewords that each have a lifting factor greater than a predefined value to the full range decoder circuit. The full range decoder circuit decodes the codewords that each have a lifting factor greater than the predefined value to generate first decoded output data. The load balancing scheduler circuit provides codewords that each have a lifting factor less than the predefined value to the auxiliary decoder circuit. The auxiliary decoder circuit decodes the codewords that each have a lifting factor less than the predefined value to generate second decoded output data.

Claims (37)

1. A decoding circuit system comprising:

a load balancing scheduler circuit;

a full range decoder circuit, wherein the load balancing scheduler circuit provides codewords that each have a lifting factor greater than a predefined value to the full range decoder circuit, and wherein the full range decoder circuit decodes the codewords that each have a lifting factor greater than the predefined value to generate first decoded output data; and

a first auxiliary decoder circuit, wherein the load balancing scheduler circuit provides codewords that each have a lifting factor less than the predefined value to the first auxiliary decoder circuit, and wherein the first auxiliary decoder circuit decodes the codewords that each have a lifting factor less than the predefined value to generate second decoded output data.

2. The decoding circuit system of claim 1 , wherein the predefined value equals a point in a curve for a probability distribution of the lifting factors of the codewords at which an area under the curve up to the predefined value is equal to an area under the curve from the predefined value up to a maximum value of the curve.

3. The decoding circuit system of claim 1 further comprising:

a second auxiliary decoder circuit, wherein the load balancing scheduler circuit provides additional codewords each having a lifting factor less than an additional predefined value to the second auxiliary decoder circuit, wherein the additional predefined value is less than the predefined value, and wherein the second auxiliary decoder circuit decodes the additional codewords to generate third decoded output data.

4. The decoding circuit system of claim 1 , wherein the full range decoder circuit comprises first processing circuits that decode the codewords that each have a lifting factor greater than the predefined value, wherein the first auxiliary decoder circuit comprises second processing circuits that decode the codewords that each have a lifting factor less than the predefined value, and wherein a number of the second processing circuits in the first auxiliary decoder circuit is less than or equal to the predefined value.

5. The decoding circuit system of claim 4 further comprising:

a second auxiliary decoder circuit, wherein the load balancing scheduler circuit provides additional codewords each having a lifting factor less than the predefined value to the second auxiliary decoder circuit, wherein the second auxiliary decoder circuit comprises third processing circuits that decode the additional codewords to generate third decoded output data, and wherein a number of the third processing circuits in the second auxiliary decoder circuit is less than or equal to the predefined value.

6. The decoding circuit system of claim 1 , wherein the load balancing scheduler circuit provides additional codewords that each have a lifting factor less than the predefined value to the full range decoder circuit, wherein the full range decoder circuit decodes the additional codewords to generate third decoded output data, and wherein the first auxiliary decoder circuit is smaller than the full range decoder circuit.

7. The decoding circuit system of claim 1 , wherein the load balancing scheduler circuit routes additional codewords that each have a lifting factor less than the predefined value to the first auxiliary decoder circuit or to the full range decoder circuit based on an amount of the codewords being processed by the full range decoder circuit and an amount of the codewords being processing by the first auxiliary decoder circuit.

8. A decoding circuit system comprising:

a load balancing scheduler circuit;

a full range decoder circuit; and

a first auxiliary decoder circuit, wherein the load balancing scheduler circuit provides first codewords having lifting factors greater than lifting factors of second codewords to the full range decoder circuit, wherein the load balancing scheduler circuit provides the second codewords to the first auxiliary decoder circuit, wherein the full range decoder circuit decodes the first codewords to generate first decoded output data, and wherein the first auxiliary decoder circuit decodes the second codewords to generate second decoded output data.

9. The decoding circuit system of claim 8 , wherein the full range decoder circuit comprises first processing circuits that decode the first codewords, wherein a number of the first processing circuits in the full range decoder circuit equals a maximum value of the lifting factors of the first codewords, wherein the first auxiliary decoder circuit comprises second processing circuits that decode the second codewords, and wherein a number of the second processing circuits in the first auxiliary decoder circuit is less than or equal to a maximum value of the lifting factors of the second codewords.

10. The decoding circuit system of claim 8 further comprising:

an aggregator circuit that aggregates the first decoded output data and the second decoded output data into a stream of messages.

11. The decoding circuit system of claim 8 further comprising:

a second auxiliary decoder circuit, wherein the load balancing scheduler circuit provides third codewords each having a lifting factor less than the lifting factor of each of the first codewords to the second auxiliary decoder circuit, and wherein the second auxiliary decoder circuit decodes the third codewords to generate third decoded output data.

12. The decoding circuit system of claim 8 , wherein the lifting factor of each of the second codewords is less than a value in a curve for a probability distribution of the lifting factors of the first and the second codewords at which an area under the curve up to the value is equal to an area under the curve from the value up to a maximum value of the curve.

13. The decoding circuit system of claim 8 , wherein the full range decoder circuit decodes the first codewords using a first low density parity check matrix that is generated using a first cyclic-shift identity matrix having a dimension equal to a maximum value of the lifting factors of the first codewords, and wherein the first auxiliary decoder circuit decodes the second codewords using a second low density parity check matrix that is generated using a second cyclic-shift identity matrix having a dimension equal to a maximum value of the lifting factors of the second codewords.

14. A method for decoding codewords, the method comprising:

providing first codewords each having a lifting factor greater than a predefined value from a load balancing scheduler circuit to a full range decoder circuit;

providing second codewords each having a lifting factor less than the predefined value from the load balancing scheduler circuit to a first auxiliary decoder circuit;

decoding the first codewords with the full range decoder circuit to generate first decoded output data; and

decoding the second codewords with the first auxiliary decoder circuit to generate second decoded output data.

15. The method of claim 14 further comprising:

providing third codewords each having a lifting factor less than the predefined value from the load balancing scheduler circuit to a second auxiliary decoder circuit; and

decoding the third codewords with the second auxiliary decoder circuit to generate third decoded output data.

16. The method of claim 14 , wherein decoding the first codewords further comprises decoding the first codewords with first processing circuits in the full range decoder circuit, and wherein a number of the first processing circuits in the full range decoder circuit equals a maximum value of the lifting factors of the first codewords.

17. The method of claim 16 , wherein decoding the second codewords further comprises decoding the second codewords with second processing circuits in the first auxiliary decoder circuit, and wherein a number of the second processing circuits in the first auxiliary decoder circuit is less than or equal to the predefined value.

18. The method of claim 14 , wherein decoding the first codewords further comprises decoding the first codewords using a first low density parity check matrix that is generated using a first cyclic-shift identity matrix having a dimension equal to a lifting factor of the full range decoder circuit, and

decoding the second codewords further comprises decoding the second codewords using a second low density parity check matrix that is generated using a second cyclic-shift identity matrix having a dimension equal to a lifting factor of the first auxiliary decoder circuit.

19. The method of claim 14 , wherein the predefined value equals a point in a curve for a probability distribution of the lifting factors of the first and the second codewords at which an area under the curve up to the predefined value is equal to an area under the curve from the predefined value up to a maximum value of the curve.

20. The method of claim 14 , wherein the first auxiliary decoder circuit is smaller than the full range decoder circuit.

Assignments (3)
SECURITY INTEREST Recorded Sep 12, 2025
From: ALTERA CORPORATION
To: BARCLAYS BANK PLC, AS COLLATERAL AGENT
Reel/Frame 073431/0309 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 19, 2024
From: INTEL CORPORATION
To: ALTERA CORPORATION
Reel/Frame 066353/0886 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 25, 2022
From: ASHJAEE, SPANTA; LUI, GEE HANG; LIN, JIUN-YEE
To: INTEL CORPORATION
Reel/Frame 059109/0106 →
Continuity (1)
Related Publication 20220182076A1 · Jun 9, 2022
References Cited (5)
US 10581457B2 · Chiu et al. · 2020 [cited by applicant]
CN 115408137A · 2022 [cited by examiner]
CN 119030665A · 2024 [cited by examiner]
C. Tarver, M. Tonnemacher, H. Chen, J. Zhang and J. R. Cavallaro, “GPU-Based, LDPC Decoding for 5G and Beyond,” in IEEE Open Journal of Circuits and Systems, vol. 2, pp. 278-290, 2021, doi: 10.1109/OJCAS.2020.3042448. (… [cited by examiner]
“5G LDPC-V Intel® FPGA IP User Guide,” Intel Corporation, Aug. 19, 2020, pp. 1-29. [cited by applicant]