IP Library Granted Patent US 12,537,544
Granted Patent B2
US 12,537,544 · App. 18/461,361 · Granted Jan 27, 2026

Low-power block code forward error correction decoder

Inventors: Youzhe Fan (Carlsbad, CA); Jining Duan (Carlsbad, CA)
Assignee: Maxlinear, Inc.
H03M13/1545H03M13/1105H03M13/157H03M13/6561
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,537,544
App. No.
18/461,361
Granted
Jan 27, 2026
Kind
B2
Abstract

A system comprises a forward error correction decoder comprising syndrome computation circuitry, key-equation solver circuitry, and search and evaluator circuitry. The syndrome computation circuitry may comprise a plurality of syndrome compute units connected in parallel. The syndrome computation circuitry may be dynamically configurable to vary a quantity of the syndrome compute units used for processing of a codeword based on conditions of a channel over which the codeword was received. The syndrome computation circuitry may be operable to use a first quantity of the syndrome compute units for processing of a first codeword received over the channel when the channel is characterized by a first bit error rate and a second quantity of the syndrome compute units for processing of a second codeword received over the channel when the channel is characterized by a second bit error rate.

Claims (52)

1 . A system comprising:

a forward error correction decoder comprising syndrome computation circuitry, key-equation solver circuitry, and search and evaluator circuitry, wherein:

the key-equation solver circuitry comprises an array of processing elements arranged in columns and rows, and

the key-equation solver circuitry is dynamically configurable to vary a first number of the rows and a second number of the columns in the array of processing elements to decode a codeword based on:

a third number of syndromes associated with the codeword to be computed, wherein the first number is greater than or equal to twice the third number, and

conditions of a channel over which the codeword was received.

2 . The system of claim 1 , wherein:

the syndrome computation circuitry comprises a plurality of syndrome compute units connected in parallel; and

each of the syndrome compute units comprises a plurality of adders, a plurality of multipliers, and a plurality of memory elements.

3 . The system of claim 1 , wherein:

the syndrome computation circuitry is operable to use a first quantity of the processing elements for processing of a first codeword received over the channel when the channel is characterized by a first bit error rate and a second quantity of the processing elements for processing of a second codeword received over the channel when the channel is characterized by a second bit error rate; and

the first quantity of the processing elements is greater than the second quantity of the processing elements and the first bit error rate is greater than the second bit error rate.

4 . The system of claim 1 , each of the processing elements of the key-equation solver circuitry comprises a plurality of multipliers, one or more adder, one or more memory elements, and one or more multiplexers.

5 . The system of claim 1 , wherein:

the search and evaluator circuitry comprises a plurality of processing units connected in parallel; and

the search and evaluator circuitry is dynamically configurable to vary a quantity of the processing units of the search and evaluator circuitry used for processing of a codeword based on conditions of a channel over which the codeword was received.

6 . The system of claim 5 , wherein each of the processing units of the search and evaluator circuitry comprises a plurality of multipliers, one or more multiplexer, and one or more memory element.

7 . The system of claim 5 , wherein:

the search and evaluator circuitry is operable to use a first quantity of the processing units for processing of a first codeword received over the channel when the channel is characterized by a first bit error rate and a second quantity of the processing units for processing of a second codeword received over the channel when the channel is characterized by a second bit error rate; and

the first quantity of the processing units of the search and evaluator circuitry is greater than the second quantity of the processing units of the search and evaluator circuitry and the first bit error rate is greater than the second bit error rate.

8 . The system of claim 1 , wherein the key-equation solver circuitry determines an error locator polynomial to find a location of an error symbol in the codeword and an error evaluator polynomial to calculate a value of the error symbol in the codeword based on the conditions of the channel.

9 . The system of claim 1 , wherein the second number is equal to one plus three times the third number.

10 . The system of claim 1 , wherein the processing elements are implemented on time-shared hardware.

11 . A method, comprising:

in a forward error correction decoder comprising syndrome computation circuitry, key-equation solver circuitry, and search and evaluator circuitry, wherein the key-equation solver circuitry comprises an array of processing elements arranged in columns and rows:

dynamically determining a quantity of the processing elements and an arrangement of a first number of columns and a second number of rows of the processing elements to use for decoding a codeword, wherein the determining is based on a third number of syndromes associated with the codeword to be computed and conditions of a channel over which the codeword was received, wherein the first number is greater than or equal to twice the third number; and

decoding the codeword using the determined quantity of processing elements.

12 . The method of claim 11 , wherein the syndrome computation circuitry comprises a plurality syndrome compute units that each comprise a plurality of adders, a plurality of multipliers, and a plurality of memory elements.

13 . The method of claim 11 , wherein:

the codeword is received over the channel when the channel is characterized by a first bit error rate;

the decoding uses a first quantity of syndrome compute units;

a second codeword is received over the channel when the channel is characterized by a second bit error rate;

the method comprises dynamically determining to use a second quantity of syndrome compute units for decoding the second codeword;

the first bit error rate is greater than the second bit error rate;

the first quantity of syndrome compute units is greater than the second quantity of syndrome compute units; and

the method comprises decoding the second codeword using the second quantity of syndrome compute units.

14 . The method of claim 11 , each of the processing elements of the key-equation solver circuitry comprises a plurality of multipliers, one or more adder, one or more memory elements, and one or more multiplexers.

15 . The method of claim 11 , wherein:

the search and evaluator circuitry comprises a plurality of processing units connected in parallel; and

the search and evaluator circuitry is dynamically configurable to vary how many of the processing units are used for processing of a codeword based on conditions of a channel over which the codeword was received.

16 . The method of claim 15 , wherein each of the processing units of the search and evaluator circuitry comprises a plurality of multipliers, one or more multiplexer, and one or more memory element.

17 . The method of claim 15 , wherein:

the codeword is received over the channel when the channel is characterized by a first bit error rate;

the decoding uses a first quantity of processing units of the search and evaluator circuitry;

a second codeword is received over the channel when the channel is characterized by a second bit error rate;

the method comprises dynamically determining to use a second quantity of processing units of the search and evaluator circuitry for decoding the second codeword;

the first bit error rate is greater than the second bit error rate;

the first quantity of processing units of the search and evaluator circuitry is greater than the second quantity of processing units of the search and evaluator solver circuitry; and

the method comprises decoding the second codeword using the second quantity of processing units of the search and evaluator circuitry.

18 . The method of claim 11 , further comprising determining an error locator polynomial to find a location of an error symbol in the codeword and an error evaluator polynomial to calculate a value of the error symbol in the codeword based on the conditions of the channel.

19 . The method of claim 11 , wherein the second number is equal to one plus three times the third number.

20 . The method of claim 11 , wherein the processing elements are implemented on time-shared hardware.

Assignments (2)
SECURITY INTEREST Recorded Jun 22, 2026
From: MAXLINEAR, INC.
To: WELLS FARGO BANK, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 075800/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 5, 2023
From: FAN, YOUZHE; DUAN, JINING
To: MAXLINEAR, INC.
Reel/Frame 064800/0336 →
Continuity (3)
Continuation 16367538 · Mar 28, 2019
Provisional Application 62648965 · Mar 28, 2018
Related Publication 20230412196A1 · Dec 21, 2023
References Cited (33)
US 4665523A · Citron · 1987 [cited by examiner]
US 5323402A · Vaccaro · 1994 [cited by examiner]
US 5901158A · Weng et al. · 1999 [cited by applicant]
US 5936972A · Meidan · 1999 [cited by examiner]
US 6061768A · Kuo et al. · 2000 [cited by applicant]
US 6470471B1 · Noguchi · 2002 [cited by applicant]
US 7870468B1 · Vanka · 2011 [cited by examiner]
US 8301987B2 · Dror et al. · 2012 [cited by applicant]
US 8327242B1 · Anholt et al. · 2012 [cited by applicant]
US 9166623B1 · Bates et al. · 2015 [cited by applicant]
US 11750223B2 · Fan et al. · 2023 [cited by applicant]
US 20030101406A1 · Song · 2003 [cited by applicant]
US 20030229842A1 · Lee et al. · 2003 [cited by applicant]
US 20040177312A1 · Xin · 2004 [cited by applicant]
US 20060048037A1 · Solomon · 2006 [cited by examiner]
US 20080195913A1 · Bates · 2008 [cited by examiner]
US 20120079236A1 · Suvakovic · 2012 [cited by examiner]
US 20140108883A1 · Tehrani · 2014 [cited by examiner]
US 20140136931A1 · Nakamura et al. · 2014 [cited by applicant]
US 20180034481A1 · Garani et al. · 2018 [cited by applicant]
US 20180157551A1 · Ryabinin et al. · 2018 [cited by applicant]
US 20180159555A1 · Ryabinin · 2018 [cited by examiner]
US 20190305800A1 · Fan et al. · 2019 [cited by applicant]
Jian Liang, R. Tessier and D. Goeckel, “A dynamically-reconfigurable, power-efficient turbo decoder,” 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Napa, CA, USA, 2004. [cited by examiner]
Sarwate, Dilip V. et al., High-Speed Architectures for Reed-Solomon Decoders, IEEE Transactions on Very Large Scale integration (VLSI) Systems, vol. 9, No. 5, Oct. 2001, pp. 641-655. [cited by applicant]
Park, J.I. et al.,Area-efficient truncated Berlekamp-Massey Architecture for Reed-Solomon Decoder, Electronics Letters Feb. 17, 2011 vol. 47 No. 4. [cited by applicant]
Reed, I.S et al., VLSI Design of Inverse-Free Berlekamp-Massey Algorithm, IEE Pproceedings-E, vol. 138, No. 5, Sep. 1991 pp. 295-298. [cited by applicant]
Ying Cui, Xiao Peng, Yu Jin, Peil in Liu, S. Kimura and S. Goto, “High-parallel LDPC decoder with power gating design,” 2011 9th IEEE International Conference on ASIC, 2011. [cited by applicant]
Hsie-Chia Chang, Chien-Ching Lin and Chen-Yi Lee, “A low-power Reed-Solomon decoder for STM-16 optical communications,” Proceedings. IEEE Asia-Pacific Conference on ASIC,, Taipei, Taiwan, 2002. [cited by applicant]
B. R. Surabhi, S. N. Nampoothiri and P. Jayakrishnan, “Design of area efficient and low power reed solomon decoder,” 2016 International Conference on Control, Instrumentation, Communication and Computational Technologie… [cited by applicant]
J. Kessels, “VLSI programming of a low-power asynchronous Reed-Solomon decoder for the DCC player,” Proceedings Second Working Conference on Asynchronous Design Methodologies, London, UK, 1995. [cited by applicant]
R. Huynh, N. Ge and H. Yang, “A low power error detection in the syndrome calculator block for reed-solomon codes: RS(204, 188),” in Tsinghua Science and Technology, vol. 14, No. 4, pp. 474-477, Aug. 2009. [cited by applicant]
X. Zhang, I. Dror and S. Alterman, “Low-power partial-parallel Chien search architecture with polynomial degree reduction,” 2016 IEEE International Symposium on Circuits and Systems (ISCAS), Montreal, QC, 2016. [cited by applicant]