Unlock instant, AI-driven research and patent intelligence for your innovation.

Multi-ary ldpc code update method based on variable node reliability dynamic selection strategy

A technology of LDPC codes and variable nodes, which is applied in the field of communication, can solve the problem of less research on dynamic scheduling decoding algorithms of multi-ary LDPC codes, and achieve the effects of accelerating convergence speed, improving decoding performance, and improving decoding performance

Active Publication Date: 2019-10-25
SUN YAT SEN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The dynamic scheduling decoding algorithm of binary LDPC codes has been studied relatively maturely, but the research on dynamic scheduling decoding algorithms of multi-ary LDPC codes is less, and further research is needed

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multi-ary ldpc code update method based on variable node reliability dynamic selection strategy
  • Multi-ary ldpc code update method based on variable node reliability dynamic selection strategy
  • Multi-ary ldpc code update method based on variable node reliability dynamic selection strategy

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0039] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments.

[0040] Such as figure 1 As shown, a multi-ary LDPC code update method based on the dynamic selection strategy of variable node reliability, based on the point residuals of variable nodes, uses the dynamic selection strategy of reliability level and voting criteria to select the most unstable variable The node information is updated, and the variable node reliability dynamic selection strategy includes:

[0041] S11. Divide all variable nodes according to the reliability level, divide the reliability level of the variable nodes into two levels, the first level is the set of variable nodes with low reliability, denoted as N 1 ; The second level is a set of variable nodes with high reliability, denoted as N 2 , if N 1 is not an empty set, go to S12, if N 1 is an empty set, execute S13, where the reliability division criteria are:

[0042] Co...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a variable node reliability dynamic selection strategy-based multi-system LDPC updating method. According to the method, based on the point residuals of variable nodes, a most unstable variable node is selected based on dynamic selection strategies of reliability levels and voting principles, and the information of the most unstable variable node is updated; not merely with the residuals adopted as a measure, all the variable nodes are divided into several classes based on the reliability levels and the voting principles, and the variable node with the largest multivariate point residual is selected from a variable node set with the lowest reliability as the most unstable variable node; the dynamic change characteristic of messages in a decoding process is fully utilized; computing resources are reasonably allocated; convergence speed is increased; and decoding performance can be improved.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a method for updating multi-ary LDPC codes based on a variable node reliability dynamic selection strategy. Background technique [0002] In the 1960s, Gallager first proposed LDPC codes, that is, binary low-density parity-check codes. In 1981, Tanner used a bidirectional Tanner graph to visually represent the decoding process of LDPC codes. However, LDPC codes were not paid much attention by many scholars at that time. Until 1996, LDPC codes in the field of encoding and decoding received extensive attention from academia and business circles and have been developed in full swing in the past two decades. 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 have a set of systematic optimization design ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H03M13/11
CPCH03M13/11
Inventor 刘星成周珍珠
Owner SUN YAT SEN UNIV