Layer specific LDPC decoder
    3.
    发明授权

    公开(公告)号:US09813080B1

    公开(公告)日:2017-11-07

    申请号:US14747042

    申请日:2015-06-23

    IPC分类号: H03M13/00 H03M13/11

    CPC分类号: H03M13/114 H03M13/112

    摘要: A method to decode low-density parity check (LDPC) encoded data using a parity check matrix having a plurality of layers, includes receiving a plurality of values at a decoder. Each value of the plurality of values represents one of a plurality of bits of an LDPC codeword encoded using the parity check matrix. The LDPC codeword is decoded using layered scheduling. A functional adjustment is applied to an approximation of belief propagation used during the decoding. At least one layer specific functional adjustment is used to provide an estimate of the codeword. An apparatus to decode low-density parity check (LDPC) encoded data using a parity check matrix having a plurality of layers includes a decoder. The decoder includes circuitry to decode, layer by layer, the LDPC encoded data utilizing functional adjustments and an algorithmic approximation to belief propagation to provide an estimate of the LDPC codeword. The functional adjustments include layer specific parameters for at least two layers of the parity check matrix associated with the codeword.

    LOW POWER LOW-DENSITY PARITY-CHECK DECODING
    8.
    发明申请
    LOW POWER LOW-DENSITY PARITY-CHECK DECODING 有权
    低功率低密度奇偶校验解码

    公开(公告)号:US20160233884A1

    公开(公告)日:2016-08-11

    申请号:US14615717

    申请日:2015-02-06

    IPC分类号: H03M13/11 H03M13/00

    摘要: In general, a minimum determination capability, adapted for determining one or more minimum values from a set of values, is provided. The minimum determination capability may enable, for a set of values, determination of a first minimum value representing a smallest value of the set of values and a second minimum value representing an approximation of a next-smallest value of the set of values. The minimum determination capability may enable, for a set of values where each of the values is represented as a respective set of bits at a respective set of bit positions, determination of a minimum value of the set of values based on a set of bitwise comparisons performed for the respective bit positions of the values.

    摘要翻译: 通常,提供适于从一组值确定一个或多个最小值的最小确定能力。 最小确定能力可以为一组值确定表示该组值的最小值的第一最小值,以及表示该组值的下一个最小值的近似值的第二最小值。 对于一组值,最小确定能力可以使得其中每个值被表示为在相应位位置集合处的相应位组的值的集合,基于一组比特比较来确定该组值的最小值 对于值的各个位位置执行。

    FAST MAPPING METHOD FOR LAYERED MIN-SUM DECODING OF LDPC CODES,
    9.
    发明申请
    FAST MAPPING METHOD FOR LAYERED MIN-SUM DECODING OF LDPC CODES, 有权
    用于LDPC码的层次最小解码的快速映射方法,

    公开(公告)号:US20160105199A1

    公开(公告)日:2016-04-14

    申请号:US14511551

    申请日:2014-10-10

    IPC分类号: H03M13/11

    摘要: A method is disclosed for performing LDPC decoding, specifically layered min-sum decoding using a Tanner graph including check nodes (CN) and variable nodes (VN). Messages passed between nodes are quantized in a non-uniform manner. Values below a threshold are uniformly quantized whereas values above the threshold are non-uniformly quantized. A corresponding inverse-quantization is also defined.

    摘要翻译: 公开了一种用于执行LDPC解码的方法,特别是使用包括校验节点(CN)和可变节点(VN)的Tanner图的分层最小和解码。 在节点之间传递的消息以不均匀的方式进行量化。 低于阈值的值被均匀地量化,而高于阈值的值被不均匀地量化。 还定义了相应的反量化。