FAST CONVERGENCE LDPC DECODING USING BCJR ALGORITHM AT THE CHECK NODES
    1.
    发明申请
    FAST CONVERGENCE LDPC DECODING USING BCJR ALGORITHM AT THE CHECK NODES 审中-公开
    使用BCJR算法的快速融合LDPC解码在检查NODES

    公开(公告)号:WO2007110436A1

    公开(公告)日:2007-10-04

    申请号:PCT/EP2007/052986

    申请日:2007-03-28

    CPC classification number: H03M13/3905 H03M13/1165 H03M13/1197 H03M13/3972

    Abstract: Method of decoding LDPC codes such as IRA codes used in the DVB-S2 standard, the code graph comprising first variable nodes (systematic), second variable nodes (parity) having a degree two, and check nodes connected to second variable nodes by a zigzag connectivity, the method comprising a) grouping the check nodes into at least one group, the check nodes of each group being connected by variable nodes called internal variable nodes, b) performing for each group (GR j ) the following sub-steps b1) and b2): b1) jointly updating (71) all the check nodes of said group by using an algorithm of the Maximum-A-Posteriori (MAP) type on a two-state trellis, b2) updating (72, 73) all the first variable nodes and all the second variable nodes (PN i-1,i ; PN i,i+1 ) connected to said group except said at least one internal second variable node, c) iteratively repeating step b). When using a plurality of groups, a corresponding plurality of trellis windows are LogMAP decoded without training period since connecting parity nodes are updated according to the sum-product algorithm.

    Abstract translation: 对DVB-S2标准中使用的诸如IRA代码的LDPC码进行解码的方法,包括具有度2的第一可变节点(系统),第二可变节点(奇偶校验)的代码图,以及通过Z字形连接到第二可变节点的校验节点 所述方法包括:a)将所述校验节点分组为至少一个组,每个组的校验节点由被称为内部变量节点的变量节点连接,b)对每个组执行(GR 以下子步骤b1)和b2):b1)通过使用两状态网格上的最大后验(MAP)类型的算法来共同更新(71)所述组的所有校验节点,b2)更新 (72,73)连接到所述组的所有第一可变节点和所有第二可变节点(PN 1,i>,N i,i + 1)除 所述至少一个内部第二可变节点,c)迭代地重复步骤b)。 当使用多个组时,由于连接奇偶校验节点根据和积算法被更新,所以对应的多个网格窗口不进行训练周期的LogMAP解码。

    METHOD AND DEVICE FOR CONTROLLING THE DECODING OF A LDPC ENCODED CODEWORD, IN PARTICULAR FOR DVB-S2 LDPC ENCODED CODEWORDS
    2.
    发明申请
    METHOD AND DEVICE FOR CONTROLLING THE DECODING OF A LDPC ENCODED CODEWORD, IN PARTICULAR FOR DVB-S2 LDPC ENCODED CODEWORDS 审中-公开
    用于控制LDPC编码编码的解码的方法和装置,特别是用于DVB-S2 LDPC编码的编码

    公开(公告)号:WO2006117135A1

    公开(公告)日:2006-11-09

    申请号:PCT/EP2006/003942

    申请日:2006-04-27

    CPC classification number: H03M13/1111 H03M13/1128 H03M13/1165 H03M13/3738

    Abstract: This is a method for controlling the decoding of a LDPC encoded codeword composed of several digital data, said LDPC code being represented by a bipartite graph between check nodes (CN 1 ) and variable nodes (VN i ). Said method compri ses updating messages exchanged iteratively between variable nodes (VN1) and check nodes (CN 1 ). Said method comprises, at each iteration, calculating for each variable node a first sum ( Λ n ) of all the incident messages ( λ i ) received by said variable node and the corresponding digital data ( λ ch ) and calculating a second sum (VNR new ) of all the absolute values of the first sums ( Λ n ), and stopping the decoding process if the second sum (VNR new ) is unchanged or decreases within two successive iterations and if a predetermined threshold condition is satisfied.

    Abstract translation: 这是一种用于控制由几个数字数据组成的LDPC编码码字的解码的方法,所述LDPC码由校验节点(CN1> 1)和可变节点(VN)之间的二分图表示, I )。 所述方法包括更新在可变节点(VN1)和校验节点(CN <1)之间迭代地交换的消息。 所述方法包括:在每次迭代时,为每个可变节点计算由所述可变节点接收的所有事件消息(?> i i i> the the the the the the the the the the the the the the) 相对应的数字数据(ΔTA),并且计算第一和(%)的所有绝对值的第二和(VNR)新的&lt; / SUB&gt; 并且如果在两个连续的迭代中第二个和(VNR新的)不变或减小,并且如果满足预定的阈值条件,则停止解码过程。

    FAST CONVERGENCE LDPC DECODING USING BCJR ALGORITHM AT THE CHECK NODES
    4.
    发明公开
    FAST CONVERGENCE LDPC DECODING USING BCJR ALGORITHM AT THE CHECK NODES 有权
    与BCJR算法的校验节点应用快速收敛解码LDPC码

    公开(公告)号:EP1999853A1

    公开(公告)日:2008-12-10

    申请号:EP07727458.7

    申请日:2007-03-28

    CPC classification number: H03M13/3905 H03M13/1165 H03M13/1197 H03M13/3972

    Abstract: Method of decoding LDPC codes such as IRA codes used in the DVB-S2 standard, the code graph comprising first variable nodes (systematic), second variable nodes (parity) having a degree two, and check nodes connected to second variable nodes by a zigzag connectivity, the method comprising a) grouping the check nodes into at least one group, the check nodes of each group being connected by variable nodes called internal variable nodes, b) performing for each group (GRj) the following sub-steps b1) and b2): b1) jointly updating (71) all the check nodes of said group by using an algorithm of the Maximum-A-Posteriori (MAP) type on a two-state trellis, b2) updating (72, 73) all the first variable nodes and all the second variable nodes (PNi-1,i; PNi,i+1) connected to said group except said at least one internal second variable node, c) iteratively repeating step b). When using a plurality of groups, a corresponding plurality of trellis windows are LogMAP decoded without training period since connecting parity nodes are updated according to the sum-product algorithm.

    METHOD AND DEVICE FOR CONTROLLING THE DECODING OF A LDPC ENCODED CODEWORD, IN PARTICULAR FOR DVB-S2 LDPC ENCODED CODEWORDS
    5.
    发明公开
    METHOD AND DEVICE FOR CONTROLLING THE DECODING OF A LDPC ENCODED CODEWORD, IN PARTICULAR FOR DVB-S2 LDPC ENCODED CODEWORDS 审中-公开
    方法和一种控制LDPC编码码字的解码,特别是用于编码的码字来自TYPE DVB-S2

    公开(公告)号:EP1878118A1

    公开(公告)日:2008-01-16

    申请号:EP06753437.0

    申请日:2006-04-27

    CPC classification number: H03M13/1111 H03M13/1128 H03M13/1165 H03M13/3738

    Abstract: This is a method for controlling the decoding of a LDPC encoded codeword composed of several digital data, said LDPC code being represented by a bipartite graph between check nodes (CN1) and variable nodes (VNi). Said method compri ses updating messages exchanged iteratively between variable nodes (VN1) and check nodes (CN1). Said method comprises, at each iteration, calculating for each variable node a first sum ( Λn) of all the incident messages ( λi ) received by said variable node and the corresponding digital data ( λch) and calculating a second sum (VNRnew) of all the absolute values of the first sums ( Λn), and stopping the decoding process if the second sum (VNRnew) is unchanged or decreases within two successive iterations and if a predetermined threshold condition is satisfied.

Patent Agency Ranking