Minimum sum decoding method of selective annealing of low density parity check code

Abstract

The invention relates to a minimum sum decoding method of selective annealing of a low density parity check code, which is suitable for soft decision decoding of the low density parity check codes and replaces the traditional multiplicative revise minimum sum decoding method. Based on the minimum sum decoding method, the invention adopts a multiplicative factor smaller than 1 to revise output of check nodes with unsuccessful check. The method comprises the following implementation steps of: merging external information quantity input by the check nodes and information from a channel by a variable node as decision soft information of iteration; probing whether a decision sequence satisfies a check equation; taking down or updating a node sequence set U with unsuccessful check, if U is empty, finishing decoding, and if U is not empty, updating and outputting information to the variable node by the check nodes based on minimum sum regulations; carrying out annealing treatment on check node output information belonging to U plus a factor smaller than 1; and turning to next iterative decoding. In the method, the performance is obviously superior to other improved minimum sum decoding method, and the calculation complexity is far lower than a sum-product algorithm.

Description

technical field

[0001] The invention relates to a simplified decoding method for soft-judgment iterative decoding of low-density parity check codes, and belongs to the technical field of channel error correction coding decoding. Background technique

[0002] Among the decoding methods of Low-Density Parity-Check (LDPC) codes, the iterative soft-decision decoding method based on bipartite graph has good bit error rate performance. For longer irregular LDPC codes , performance close to the Shannon limit can be achieved. The standard soft-decision algorithm is called the sum product algorithm. When the algorithm calculates the information output of the check node, whether it is decoding in the probability domain or the log likelihood ratio domain, it always involves a large number of additions, multiplications, Logarithmic and exponential operations, plus a large number of nodes, make the operation more complex. The minimum-sum decoding method is a simplification of the algor...

Images