MIN-SUM DECODING FOR LDPC CODES
    6.
    发明申请

    公开(公告)号:US20190097656A1

    公开(公告)日:2019-03-28

    申请号:US15903604

    申请日:2018-02-23

    申请人: SK hynix Inc.

    IPC分类号: H03M13/11 H03M13/00

    摘要: Techniques are described for performing a check node update (CNU) as part of iterative decoding of a low density-parity check (LDPC) code. The CNU uses a min-sum decoding approach that monitors whether two values received in messages from two variable nodes connected to a check nodes are equal and are the minimum value among the values received by the check nodes from other variable nodes connected thereto. Upon detecting such an event, the minimum value is adjusted by reducing it by an adjustment value to generate an adjusted minimum value. This adjusted minimum value approximates the minimum value that a sum-product algorithm (SPA) decoding approach would have generated. The adjusted minimum value is included in a response message sent from the check node to a variable node. The bit corresponding to that variable node is decoded based on this adjusted minimum value.

    GROEBNER-BASES APPROACH TO FAST CHASE DECODING OF GENERALIZED REED-SOLOMON CODES

    公开(公告)号:US20190068319A1

    公开(公告)日:2019-02-28

    申请号:US15683456

    申请日:2017-08-22

    IPC分类号: H04L1/00 H03M13/15

    摘要: An application specific integrated circuit (ASIC) tangibly encodes a program of instructions executable by the integrated circuit to perform a method for fast Chase decoding of generalized Reed-Solomon (GRS) codes. The method includes using outputs of a syndrome-based hard-decision (HD) algorithm to find an initial Groebner basis G for a solution module of a key equation, upon failure of HD decoding of a GRS codeword received by the ASIC from a communication channel; traversing a tree of error patterns on a plurality of unreliable coordinates to adjoin a next weak coordinate, where vertices of the tree of error patterns correspond to error patterns, and edges connect a parent error pattern to a child error pattern having exactly one additional non-zero value, to find a Groebner basis for each adjoining error location; and outputting an estimated transmitted codeword when a correct error vector has been found.