Data separation during garbage collection and wear leveling

    公开(公告)号:US10725668B1

    公开(公告)日:2020-07-28

    申请号:US14817118

    申请日:2015-08-03

    Applicant: SK hynix Inc.

    Abstract: A type of data relocation to perform on a group of solid state storage cells is selected from a group that includes garbage collection and wear leveling. Source blocks in the group of solid state storage cells are identified using the selected type of data relocation. The source blocks are read in order to obtain relocated data and the relocated data is stored in an open block in the group of solid state storage cells. Relocated data associated with the selected type of data relocation is stored in the open block and relocated data associated with the unselected type of data relocation is excluded from the open block.

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

    公开(公告)号:US09590658B1

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

    申请号:US14444712

    申请日:2014-07-28

    Applicant: SK Hynix Inc.

    CPC classification number: H03M13/112 H03M13/1117 H03M13/1122 H03M13/1137

    Abstract: 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.

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

    Read disturb detection
    8.
    发明授权
    Read disturb detection 有权
    读干扰检测

    公开(公告)号:US09570198B2

    公开(公告)日:2017-02-14

    申请号:US14602151

    申请日:2015-01-21

    Applicant: SK Hynix Inc.

    CPC classification number: G11C29/42 G11C11/5642 G11C29/36 G11C29/52

    Abstract: It is determined that a read count has reached one of a set of read count thresholds. An initial test page which corresponds to the read count threshold that has been reached is selected from a set of initial test pages. There is at least one page that is not in the set of initial test pages and is victimized by an offending page that also victimizes a page in the set of initial test pages. A test read is performed on the selected test page and the results of the test read of the selected test page are evaluated for read disturb noise.

    Abstract translation: 确定读取计数已经达到一组读取计数阈值中的一个。 从一组初始测试页中选择对应于已经达到的读取计数阈值的初始测试页面。 至少有一个页面不在初始测试页面集合中,并且受到一个违规页面的伤害,该页面也会影响初始测试页面集中的页面。 对选定的测试页进行测试读取,并对所选测试页的测试结果进行读取干扰噪声。

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

    公开(公告)号:US09455747B1

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

    申请号:US14223643

    申请日:2014-03-24

    Applicant: SK Hynix Inc.

    Abstract: 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.

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

Patent Agency Ranking