Dynamic asynchronous update method of ldpc code based on v2c dynamic selection strategy

Abstract

The invention discloses an LDPC code dynamic asynchronous update method based on a V2C dynamic selection strategy. In a point residual of variable nodes and in a side residual from the variable nodes to check nodes, the most instable variable node and the most unreliable side information can be dynamically selected by triple determination to be preferably updated. According to the LDPC code dynamic asynchronous update method disclosed by the invention, the residual is not used as the sole measure, but stability judgment conditions are set, the dynamic characteristics of message variation in a decoding process are fully used to quickly and accurately position the most unreliable message, and a more reasonable message update sequence can be provided for the dynamic asynchronous update method based on the message residuals of the variable nodes and the variable nodes to the check nodes, so that the proposed method can be used for reasonably allocating computing resources to accelerate the convergence speed and improve the decoding performance.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a dynamic asynchronous update method of LDPC codes based on a V2C dynamic selection strategy. Background technique [0002] In the 1960s, Gallager first proposed LDPC codes, that is, binary low-density parity-check codes. Since LDPC codes were rediscovered in 1996, LDPC codes have received extensive attention from academia and industry. In the course of more than ten years of research, the excellent performance of LDPC codes has gradually emerged. LDPC codes are a kind of linear block codes with interleaving characteristics, which have good performance against burst errors without introducing an interleaver, and can avoid time delay. The sparseness of the codeword itself makes the decoding complexity of the LDPC code lower, and has a lower error floor. From codeword construction to decoding algorithm optimization and final performance analysis, LDPC codes hav...

AI Technical Summary

Problems solved by technology

In the point residuals based on variable nodes and the edge residuals from variable nodes to check nodes, the dynamic selection strategy is to choose residuals as the measure, but the dynamic selection strategy that relies solely on residuals is inaccurate to a certain extent , will cause misjudgment of unreliable information

Images