Invention Grant
US08504890B2 Scheduling for LDPC decoding 有权
LDPC解码调度

Scheduling for LDPC decoding
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
Information query
Patent Agency Ranking
0/0