DECODING METHOD OF LOW DENSITY PARITY CHECK CODE AND INFORMATION STORING METHOD IN THE DECODING METHOD

摘要

A decoding method of a LDPC comprises following steps. A first predetermined number of iterations of a messages-passing decoding algorithm are applied to a received signal vector, so as to attempt to decode a transmitted (or stored) codeword. Whether the decoding result converges to a valid codeword is determined by observing whether the decoding result makes all check nodes satisfied or not. When the decoding result does not converge to a valid codeword, the value of at least one of the variable nodes neighboring to one of the un-satisfied check node is be adjusted to a non-zero value, wherein the selected variable node is included in a trapping set. Then, a second predetermined number of iterations of the messages-passing decoding algorithm are applied to the updated decoding result to generate another one decoding result, and whether the other one decoding result converges to a valid codeword is checked.

主权项

1. A decoding method of a LDPC code, executed in an electronic apparatus, comprising:
step A: applying a first predetermined number of iterations of a messages-passing decoding algorithm to a received signal vector, so as to obtain as decoding result; step B: determining whether the decoding result converges to a valid codeword; step C: if the decoding result does not converge to the valid codeword, executing at least one of steps C1 and C2:
the step C1: adjusting values of at least one of variable nodes neighboring to at least one of unsatisfied check nodes to a non-zero value, so as to update the decoding result; andthe step C2: flipping the values of the variable nodes corresponding to the unsatisfied check nodes of trapping sets recorded in a first table, so as to update the decoding result, wherein the first table merely records location information of the unsatisfied check nodes in the trapping sets and location information of merely one of the variable nodes neighboring to the unsatisfied check nodes in the trapping sets; and step D: applying a second predetermined number of the iterations of the messages-passing decoding algorithm to the updated decoding result, so as to obtain a new decoding result.