发明申请
- 专利标题: REDUCED COMPLEXITY NON-BINARY LDPC DECODING ALGORITHM
- 专利标题(中): 减少复杂非二进制LDPC解码算法
-
申请号: US14607039申请日: 2015-01-27
-
公开(公告)号: US20150143194A1公开(公告)日: 2015-05-21
- 发明人: Majid NEMATI ANARAKI , Xinde Hu , Richard D. Barndt
- 申请人: HGST Netherlands B.V.
- 主分类号: H03M13/11
- IPC分类号: H03M13/11
摘要:
Decoding logic is provided that is operational upon a data buffer to represent a plurality of variable nodes and a plurality of check nodes. For a respective one of the variable nodes, a vector component is selected from a confidence vector associated with the variable node. Using a respective one of the check nodes, a check node return value is calculated based on one or more other vector components from one or more other vectors and one or more vector indices corresponding to the one or more other vector components. The confidence vector is then updated based on the check node return value and an index for the check node return value, and a current state of a memory cell associated with the respective one of the variable nodes is determined based on a location of a primary one of multiple vector components within the updated confidence vector.
公开/授权文献
- US09319069B2 Reduced complexity non-binary LDPC decoding algorithm 公开/授权日:2016-04-19
信息查询
IPC分类: