Decoding early termination method for low density parity check codes

Abstract

The invention discloses a decoding early termination method for low-density parity check codes. The method is characterized in that for a decoder utilizing belief propagation decoding algorithms, every time an iterative computation of side information which variable nodes transmit to check nodes is performed, firstly computed coding hard decision bits of every variable node is carried to the front of the most significant bit or the back of the least significant bit of the side information transmitted from the variable nodes to the check nodes which are connected with the variable nodes on bipartite graphs, accordingly combined information is formed and transmitted to the check nodes; and while information transmitted from the check nodes to the variable nodes is computed, every check node extracts the coding hard decision bits from the combined information transmitted from the variable nodes which are connected with the check nodes on the bipartite graphs and performs syndrome computation: if all syndromes are zero, the iterative decoding is terminated early. The decoding early termination method for the low-density parity check codes can guarantee the accuracy of decoding and simultaneously reduce the working time delay of the decoder as much as possible, thereby improving the working efficiency.

Description

technical field [0001] The invention relates to a decoding technology, in particular to an early termination method for decoding a low density parity check code. Background technique [0002] Low Density Parity Check Code (LDPC code for short) is a linear block code, which can be described by generating matrix, corresponding check matrix or bipartite graph (Tanner graph); its decoding algorithm includes bit Three types of algorithms: Bit Flipping, Belief Propagation, and Iterative Ordered Statistics Decoding; among them, belief propagation algorithms based on bipartite graphs such as BP decoding algorithm, minimum sum decoding algorithm It has good decoding performance. Regular or irregular LDPC long codes with excellent performance have good iterative convergence performance. When the maximum number of iterations is set large enough, most of the wrong frames can converge through iterations and finally be successfully decoded. When the signal-to-noise ratio is relatively h...

AI Technical Summary

Problems solved by technology

It can be seen that, compared with the CAS criterion, when using the automatic stop criterion

Images