Invention Grant
- Patent Title: Scheduling for LDPC decoding
- Patent Title (中): LDPC解码调度
-
Application No.: US11876868Application Date: 2007-10-23
-
Publication No.: US08504890B2Publication Date: 2013-08-06
- Inventor: Eran Sharon , Simon Litsyn
- Applicant: Eran Sharon , Simon Litsyn
- Applicant Address: IL Tel Aviv
- Assignee: Ramot at Tel Aviv University Ltd.
- Current Assignee: Ramot at Tel Aviv University Ltd.
- Current Assignee Address: IL Tel Aviv
- Agency: Alston & Bird LLP
- Main IPC: H03M13/37
- IPC: H03M13/37 ; H03M13/33

Abstract:
A codeword is decoded by receiving a codeword representation that includes a plurality of soft bits and iteratively updating the soft bits. Whether each soft bit participates in at least some iterations is determined according to a selection criterion, e.g., probabilistically, or according to iteration number, or according to the soft bit's iteration history. For example, each soft bit might participate in some or all iterations with a probability that is a function of both the iteration number and a reliability measure of that soft bit. Preferably, the iterations are LDPC iterations in which variable nodes are addressed sequentially for exchanging messages with corresponding check nodes.
Public/Granted literature
- US20080148128A1 Lazy Scheduling For LDPC Decoding Public/Granted day:2008-06-19
Information query
IPC分类: