发明申请
US20090222710A1 SELECTIVELY APPLIED HYBRID MIN-SUM APPROXIMATION FOR CONSTRAINT NODE UPDATES OF LDPC DECODERS
有权
LDPC解码器的约束节点更新的选择性混合最小最小似然估计
- 专利标题: SELECTIVELY APPLIED HYBRID MIN-SUM APPROXIMATION FOR CONSTRAINT NODE UPDATES OF LDPC DECODERS
- 专利标题(中): LDPC解码器的约束节点更新的选择性混合最小最小似然估计
-
申请号: US12040230申请日: 2008-02-29
-
公开(公告)号: US20090222710A1公开(公告)日: 2009-09-03
- 发明人: Ara Patapoutian , Rose Y. Shao , Arvind Sridharan
- 申请人: Ara Patapoutian , Rose Y. Shao , Arvind Sridharan
- 主分类号: H03M13/00
- IPC分类号: H03M13/00
摘要:
In accordance with one or more embodiments, a decoder may determine whether a lowest reliability value of a plurality of codeword bits that correspond to a particular output reliability value for a particular constraint node of a parity-check matrix is greater than a threshold value (e.g., an offset), and if so, selectively applies a modified min-sum approximation constraint node update with a reliability value modification (e.g., an offset or normalized min-sum approximation).
公开/授权文献
信息查询
IPC分类: