Invention Grant
US07752523B1 Reduced-complexity decoding of parity check codes 有权
奇偶校验码的复杂度降低解码

Reduced-complexity decoding of parity check codes
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.
Information query
Patent Agency Ranking
0/0