IP Library Granted Patent US 8,281,210
Granted Patent B1
US 8,281,210 · App. 12/118,650 · Granted Oct 2, 2012

Optimized correction factor for low-power min-sum low density parity check decoder (LDPC)

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 8,281,210
App. No.
12/118,650
Granted
Oct 2, 2012
Kind
B1
Abstract

An iterative decoder configured to implement a min-sum with correction algorithm. The iterative decoder includes N parity check nodes coupled to M equality constraint nodes. The iterative decoder further includes a first parity check node configured to send an output to a first equality constraint node. Responsive to a minimum magnitude of other M−1 inputs to the first parity check node being lower than a pre-determined threshold, the parity check node sends the output having a same magnitude as that of the minimum magnitude of the other M−1 inputs to the first parity check node. Responsive to the minimum magnitude of the other M−1 inputs to the first parity check node being greater than the pre-determined threshold, the parity check node subtracts a correction factor in the form of p·2 q from the minimum magnitude.

Claims (24)

1. An iterative decoder configured to implement a min-sum with correction algorithm, the iterative decoder having N parity check nodes coupled to M equality constraint nodes, the iterative decoder having a configurable decoder SNR gain versus decoder complexity, the decoder comprising:

a first parity check node configured to send an output to a first equality constraint node,

wherein responsive to a minimum magnitude of other M−1 inputs to the first parity check node being lower than a pre-determined threshold, the panty check node sends the output having the same minimum magnitude as that of the minimum magnitude of the other M−1 inputs to the first parity check node, whose sign is the product of the signs of all M−1 inputs,

wherein responsive to the minimum magnitude of the other M−1 inputs to the first parity check node being greater than the pre-determined threshold, the parity check node subtracts a correction factor in the form of p·2 q from the minimum magnitude, whose sign is the product of the signs of all M−1 inputs, and

wherein p and q represent selectable integers such that a higher value of q corresponds to a lower decoder complexity, and the decoder SNR gain is based on the value of P such that a lower magnitude of a difference between the correction factor and an optimal correction factor increases the decoder SNR gain.

2. The iterative decoder of claim 1 , wherein the correction, factor is identified empirically.

3. The iterative decoder of claim 2 , wherein;

the output has a resolution of 8 bits; and

the correction factor is 19.

4. The iterative decoder of claim 3 , wherein the correction factor is in the form of one of the following: 9×2 1 , 2 4 , 5×2 2 , 11×2 1 , or 3×2 3 .

5. The iterative decoder of claim 4 , wherein the iterative decoder is one of a low density parity check (LDPC) decoder, a Hamming decoder, or a Turbo decoder.

6. The iterative decoder of claim 5 , wherein the iterative decoder is compliant with IEEE 10G-BaseT standards.

7. A method for selecting a correction factor for use in an iterative decoder that implements a min-sum with correction algorithm, the iterative decoder having N parity check nodes coupled to M equality constraint nodes and having a configurable decoder SNR gain versus decoder convexity, the method comprising:

sending an output from a first parity check node to a first equality constraint node,

wherein responsive to a minimum magnitude of other M−1 inputs to the first parity check node being lower than a pre-determined threshold, sending the output from the first parity check node includes sending the output having the same minimum magnitude as that of the minimum magnitude of the other M−1 inputs to the first parity check node whose sign is the product of the signs of all M−1 inputs,

wherein responsive to the minimum magnitude of the other M−1 inputs to the first parity check node being greater than the pre-determined threshold, the method further includes subtracting a correction factor in the form of p·2 q from the minimum magnitude whose sign being product of the signs of, all M−1 inputs prior to sending the output to the first equality constraint node, and

wherein p and q represent selectable integers such that a higher value of q corresponds to a lower decoder complexity and the decoder SNR gain is based on the value of P such that a lower magnitude of a difference between the correction factor and an optimal correction factor increases the decoder SNR gain.

8. The method of claim 7 , wherein the correction factor is identified empirically.

9. The method of claim 8 , wherein:

the output has a resolution of bits; and

the correction factor is 19.

10. The method of claim 9 , wherein the correction factor is in the form of one of the following: 9×2 1 , 2 4 , 5×2 2 , 11×2 1 , or 3×2 3 .

11. The method of claim 10 , wherein the iterative decoder is one of a low density parity check (LDPC) decoder, a Hamming decoder, or a Turbo decoder.

12. The method of claim 11 , wherein the iterative decoder is compliant with IEEE 10G-BaseT standards.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 15, 2020
From: CAVIUM INTERNATIONAL
To: MARVELL ASIA PTE, LTD.
Reel/Frame 053179/0320 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 17, 2020
From: AQUANTIA CORPORATION
To: CAVIUM INTERNATIONAL
Reel/Frame 051945/0520 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 13, 2008
From: SHIRANI, RAMIN; FARJADRAD, RAMIN
To: AQUANTIA CORPORATION
Reel/Frame 020943/0018 →