知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

14 条记录 (耗时 0.017 秒)

    Min-sum decoding for LDPC codes
    3.
    发明授权
    Min-sum decoding for LDPC codes 有权

    公开(公告)号：US10680647B2

    公开(公告)日：2020-06-09

    申请号：US15903604

    申请日：2018-02-23

    申请人： SK hynix Inc.

    发明人： Aman Bhatia ,  Naveen Kumar ,  Abhiram Prabhakar ,  Chenrong Xiong ,  Fan Zhang

    IPC分类号： G06F11/00 ,  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.

    Memory system with hybrid decoding scheme and method of operating such memory system
    4.
    发明授权
    Memory system with hybrid decoding scheme and method of operating such memory system 有权

    公开(公告)号：US11005503B2

    公开(公告)日：2021-05-11

    申请号：US16297277

    申请日：2019-03-08

    申请人： SK hynix Inc.

    发明人： Naveen Kumar ,  Aman Bhatia ,  Abhiram Prabhakar ,  Chenrong Xiong ,  Fan Zhang

    IPC分类号： H03M13/37 ,  G11C29/52 ,  H03M13/11 ,  G06F11/10

    摘要： Memory controllers, decoders and methods execute a hybrid decoding scheme. An initial iteration of decoding of a codeword is performed using a bit-flipping (BF) decoder or a min-sum (MS) decoder depending on whether or not an unsatisfied check (USC) count of the codeword is less than a threshold. For this initial iteration, the BF decoder is used when the USC count is less than the threshold, and MS decoder when the USC count is greater than or equal to the threshold. When decoding of the codeword is initially performed with the BF decoder, decoding continues with the BF decoder until a first set of conditions is satisfied or the codeword is successfully decoded. When decoding of the codeword is performed with the MS decoder, decoding continues with the MS decoder until a second set of conditions is satisfied.

    High-speed low-power LDPC decoder design
    5.
    发明授权
    High-speed low-power LDPC decoder design 有权
    高速低功耗LDPC解码器设计

    公开(公告)号：US09590658B1

    公开(公告)日：2017-03-07

    申请号：US14444712

    申请日：2014-07-28

    申请人： SK Hynix Inc.

    发明人： LingQi Zeng ,  Abhiram Prabhakar ,  Jason Bellorado ,  Johnson Yen

    IPC分类号： H03M13/00 ,  H03M13/11

    CPC分类号： H03M13/112 ,  H03M13/1117 ,  H03M13/1122 ,  H03M13/1137

    摘要： Decoding an LDPC encoded codeword is disclosed. Variable nodes corresponding to a parity check matrix of the LDPC encoded codeword have been divided into a plurality of groups. A selected group of variable nodes from the plurality of groups of variable nodes is updated. Check nodes are updated using a min-sum update. A selected input value provided from a variable node of the selected group of variable nodes and provided to a certain check node of the check nodes is discarded to be not available for use in a future min-sum update.

    摘要翻译： 公开了解码LDPC编码码字。 对应于LDPC编码码字的奇偶校验矩阵的可变节点已被划分成多个组。 来自多个变量节点组的所选择的变量节点组被更新。 使用最小和更新更新检查节点。 从所选择的变量节点组的变量节点提供并提供给校验节点的某个校验节点的选择的输入值被丢弃为不可用于将来的最小和更新。

    Parallel chien search with folding and a symbolized minimal polynomial combinational network (S-MPCN)
    6.
    发明授权
    Parallel chien search with folding and a symbolized minimal polynomial combinational network (S-MPCN) 有权
    平行搜索与折叠和符号最小多项式组合网络（S-MPCN）

    公开(公告)号：US09455747B1

    公开(公告)日：2016-09-27

    申请号：US14223643

    申请日：2014-03-24

    申请人： SK Hynix Inc.

    发明人： Yi-Min Lin ,  Abhiram Prabhakar ,  Lingqi Zeng ,  Jason Bellorado

    IPC分类号： H03M13/00 ,  H03M13/15

    CPC分类号： H03M13/1575 ,  H03M13/152 ,  H03M13/1545 ,  H03M13/616 ,  H03M13/6561

    摘要： A hinge path is used to determine if a first possible root is a root of an error location polynomial. A positive limb path is used to determine if a second possible root is a root of the error location polynomial, including by using a sequence of coefficients associated with the error location polynomial. The sequence of coefficients is reversed and a negative limb path is used to determine if a third possible root is a root of the error location polynomial, including by using the reversed sequence of coefficients, wherein the negative limb path is a copy of the positive limb path.

    摘要翻译： 铰链路径用于确定第一可能根是否是错误位置多项式的根。 使用正极路径来确定第二可能根是否是错误位置多项式的根，包括通过使用与误差位置多项式相关联的系数序列。 系数序列被反转，并且使用负肢路径来确定第三可能根是否是误差位置多项式的根，包括通过使用反向的系数序列，其中，所述负肢路径是所述阳性肢体的副本 路径。

    Low-complexity LDPC encoder
    7.
    发明授权
    Low-complexity LDPC encoder 有权

    公开(公告)号：US10389383B2

    公开(公告)日：2019-08-20

    申请号：US15654492

    申请日：2017-07-19

    申请人： SK Hynix Inc.

    发明人： Chenrong Xiong ,  Fan Zhang ,  Aman Bhatia ,  Abhiram Prabhakar ,  Yu Cai ,  Naveen Kumar

    IPC分类号： H03M13/11 ,  H03M13/25 ,  H03M13/00

    摘要： Techniques are described for encoding information data bits using a low-density parity-check matrix optimized for a Low-Density Parity-Check (LDPC) encoder. In an example, the parity-check matrix includes a first matrix and a second matrix. The second matrix is a square matrix, and is also a block diagonal matrix that includes a set of square submatrices located on the diagonal of the block diagonal matrix. An intermediate vector is generated based on the information data bits and the first matrix, and a parity vector of a codeword is generated based on the intermediate vector and the second matrix.

    MIN-SUM DECODING FOR LDPC CODES
    8.
    发明申请
    MIN-SUM DECODING FOR LDPC CODES 审中-公开

    公开(公告)号：US20190097656A1

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

    申请号：US15903604

    申请日：2018-02-23

    申请人： SK hynix Inc.

    发明人： Aman Bhatia ,  Naveen Kumar ,  Abhiram Prabhakar ,  Chenrong Xiong ,  Fan Zhang

    IPC分类号： H03M13/11 ,  H03M13/00

    CPC分类号： H03M13/1117 ,  H03M13/1108 ,  H03M13/112 ,  H03M13/1131 ,  H03M13/1177 ,  H03M13/616 ,  H03M13/6502

    摘要： 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.

    Techniques for adaptive LDPC decoding
    10.
    发明授权
    Techniques for adaptive LDPC decoding 有权

    公开(公告)号：US09866241B2

    公开(公告)日：2018-01-09

    申请号：US15073034

    申请日：2016-03-17

    申请人： SK Hynix Inc.

    发明人： Johnson Yen ,  Abhiram Prabhakar ,  Chung-Li Wang

    IPC分类号： H03M13/11 ,  H03M13/45

    CPC分类号： H03M13/1128 ,  H03M13/1111 ,  H03M13/1177 ,  H03M13/35 ,  H03M13/45 ,  H03M13/658

    摘要： Techniques are described for an adaptive low density parity check (LDPC) decoder. The techniques include receiving a first set of values corresponding to a first low density parity check codeword and noise, performing a first plurality of iterations of an iterative decoding algorithm using a first set of decoding parameters to decode the received first set of values, comparing a metric with a first threshold, and upon determining that the metric is larger than the threshold: selecting a second set of decoding parameters for the iterative LDPC decoder and performing a second plurality of iterations of the iterative LDPC decoding algorithm using the second set of decoding parameters to decode the received first set of values and generate a first set of decoded bits.