LDPC (Low Density Parity Check) code dynamic flipping decoding method based on grouping parallel processing

Abstract

The invention discloses an LDPC (Low Density Parity Check) code dynamic flipping decoding method based on grouping parallel processing. The method detects whether flip sequences of two adjacent iterations in an iterative flip decoding process cause decoding to be in a state loop or not, and after the state loop is detected, a packet bit flip threshold and a flip bit number are dynamically changed,so that the invalid iteration of bit flip decoding is effectively avoided and system performance is improved. Whether a state cycle condition exists in grouped bit flipping decoding or not is judgedthrough simple check formula calculation, that is, when two adjacent check formula sequences are the same, a judgment is made that iterative decoding falls into an error cycle, and bits cannot be flipped effectively. After the cyclic state is judged, the state cycle is effectively broken by adopting a method of dynamically changing the packet bit flipping threshold and the flipping bit number, andperformance improvement is obtained. The improved method is established on the basis of hard decision flipping decoding, and is fast in iterative convergence, high in decoding throughput rate and lowin implementation complexity.

Description

technical field [0001] The invention relates to an iterative decoding method of LDPC codes, in particular to an improved algorithm based on a packet hard-decision bit flip decoding algorithm, and belongs to the technical field of decoding. Background technique [0002] Low Density Parity Check (LDPC, Low Density Parity Check) code is a linear block code, which can be represented by Tanner diagram and parity check matrix H. The number of non-zero elements in the parity check matrix is ​​far less than zero elements the number of . Because of its superior performance close to the Shannon limit, it has attracted great attention in the field of channel coding. At present, LDPC codes have been widely used in mobile and deep space communications and other fields, and have very important application prospects. For a regular LDPC code, each row and each column contain the same number of non-zero elements, where the number of non-zero elements in each column (row) is called the colum...

AI Technical Summary

Problems solved by technology

But compare and sort the flip weights, looking for the global top F x One bit, the complexity is large, and a large number of comparison units and storage units are required in the hardware. Based on this, the author proposes an AMBF algorithm, which divides the codeword into Q groups, and selects a bit with the largest flip weight value from each group. Bits form a set of candidate flip bits of size Q, from which F x A local maximum with the largest flip weight is flipped

Images