Reduced-complexity decoding of parity check codes
AssigneeMarvell International Ltd.
InventorsPanu Chaichanavong, Gregory Burd
Life of this patent
Estimating the term…
Abstract
The disclosed technology provides a less resource intensive way to decode a parity check code using a modified min-sum algorithm. For a particular parity check constraint that includes n variable nodes, an LDPC decoder can compute soft information for one of the variable nodes based on combinations of soft information from other variable nodes, wherein each combination includes soft information from at most a number d of other variable nodes. In one embodiment, soft information from one of the other variable nodes is used in a combination only if it corresponds to a non-most-likely value for the other variable node.
Claims42
A method for generating soft information for a variable node from a check node to decode a parity check code, wherein the check node is associated with other co-constraint nodes, the method comprising:
- accessing soft information from the co-constraint nodes;
- determining a first component-wise minimum and a second component-wise minimum based on the soft information;
- forming combinations of the first component-wise minimum and the second component-wise minimum;
- and
- computing soft information for the variable node based on the combinations.
A system for generating soft information for a variable node from a check node to decode a parity check code, wherein the check node is associated with other co-constraint nodes, the system comprising:
- circuitry that accesses soft information from the co-constraint nodes;
- circuitry that determines a first component-wise minimum and a second component-wise minimum based on the soft information;
- circuitry that forms combinations of the first component-wise minimum and the second component-wise minimum;
- and
- circuitry that computes soft information for the variable node based on the combinations.
A system for generating soft information for a variable node from a check node to decode a parity check code, wherein the check node is associated with other co-constraint nodes, the system comprising:
- means for accessing soft information from the co-constraint nodes;
- means for determining a first component-wise minimum and a second component-wise minimum based on the soft information;
- means for forming combinations of the first component-wise minimum and the second component-wise minimum;
- and
- means for computing soft information for the variable node based on the combinations.
Dependencies are inferred from the claim text.