Low density parity-check code decoding
    1.
    发明公开
    Low density parity-check code decoding 审中-公开
    Decodierung von低密度奇偶校验(LDPC)码

    公开(公告)号:EP2464019A1

    公开(公告)日:2012-06-13

    申请号:EP10290645.0

    申请日:2010-12-09

    申请人: NXP B.V.

    IPC分类号: H03M13/25

    摘要: A method and apparatus for layered decoding of a codeword encoded using a Low Density Parity-check code. The code defines a plurality of variable nodes corresponding to the bits of the codeword and a plurality of check nodes. Each check node is associated with two or more variable nodes. The method comprises: defining (510) a plurality of layers, each layer comprising a group of nodes of one type to be updated together; detecting (520) a conflict within a layer, wherein first and second nodes among the group of nodes are associated with a third node of the other type, whereby, in an update-step of the decoding method, both the first and second nodes will attempt to write to a memory address corresponding to the third node; and repeating the update-step, to avoid the conflict, comprising: performing a first update-step (530, 540, 550) wherein the second node updates the third node; and performing a second update-step (560, 570, 580) wherein the first node updates the third node.

    摘要翻译: 一种用于使用低密度奇偶校验码编码的码字的分层解码的方法和装置。 代码定义对应于码字的比特和多个校验节点的多个变量节点。 每个校验节点与两个或多个可变节点相关联。 该方法包括:定义(510)多个层,每个层包括一组类型的要一起更新的节点组; 检测(520)层内的冲突,其中所述节点组中的第一和第二节点与另一类型的第三节点相关联,由此在所述解码方法的更新步骤中,所述第一和第二节点将 尝试写入对应于第三节点的存储器地址; 并且重复所述更新步骤以避免所述冲突,包括:执行第一更新步骤(530,540,550),其中所述第二节点更新所述第三节点; 以及执行其中所述第一节点更新所述第三节点的第二更新步骤(560,570,580)。