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

A Dynamic Scheduling Decoding Method for ldpc Codes Based on Oscillating Variable Nodes

A technology of LDPC codes and variable nodes, applied in the field of communication, can solve the problem of difficult and accurate positioning of unreliable information, and achieve the effects of optimizing the update sequence of messages, improving decoding performance, and overcoming trap sets.

Active Publication Date: 2018-01-02
SUN YAT SEN UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] Aiming at the deficiencies of the existing dynamic scheduling decoding algorithm, the present invention provides an LDPC code dynamic scheduling decoding algorithm based on oscillation variable nodes, which solves the problem that it was difficult to accurately locate unreliable information in the past

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
  • A Dynamic Scheduling Decoding Method for ldpc Codes Based on Oscillating Variable Nodes
  • A Dynamic Scheduling Decoding Method for ldpc Codes Based on Oscillating Variable Nodes
  • A Dynamic Scheduling Decoding Method for ldpc Codes Based on Oscillating Variable Nodes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] The present invention will be further described below in conjunction with the accompanying drawings.

[0049] like figure 2 As shown, through the flow chart, you can clearly understand the specific process of the triple determination condition. The steps are as follows:

[0050] S11. Determine whether there is an oscillating variable node, if not, directly select the residual, that is, r(m k )=||f(m k )-m k ||The largest variable node is the least reliable variable node, where: the variable node message is m k , after updating f(m k ); if yes, execute S22;

[0051] S12. Calculate the number of verification equations not satisfied by the variable node of oscillation, if the maximum value is not reached, select the variable node with the largest residual error in the oscillation variable node as the most unreliable variable node; if reached, execute S13;

[0052] S13. Select the variable node with the largest residual error as the least reliable variable node among...

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 an LDPC code dynamic scheduling and decoding method based on an oscillation variable node, which adopts a dynamic selection strategy of setting triple judgment conditions to determine the variable node with the lowest reliability for updating. The present invention can make more reasonable and accurate judgments on the reliability of variable nodes, optimize the message update sequence of the dynamic scheduling decoding algorithm, and effectively overcome the influence of trap sets in the Tanner diagram; at the same time, the oscillation is defined and processed from the perspective of variable nodes, The impact of error information is reduced, and the decoding performance of the algorithm is improved.

Description

technical field [0001] The invention belongs to the technical field of communication, and relates to an LDPC code dynamic scheduling decoding method based on an oscillating variable node (Oscillatory-Variable-Node-Based Binary LDPC Code Dynamic Decoding Algorithm, OVB RBP method for short). Background technique [0002] In the 1860s, Gallager first proposed LDPC codes. Since the excellent error correction performance of LDPC codes was rediscovered by MacKay and Neal in 1996, it has been proved that the Belief Propagation (BP) decoding algorithm can be used when the code length is long enough. It has performance close to the Shannon limit when decoding. Compared with other error-correcting codes, LDPC codes have many advantages: the error floor can reach a lower level, iterative decoding can be performed in parallel, perfect optimization design methods, low-latency, low-complexity Decoding algorithm and strong ability to resist burst errors. Therefore, LDPC codes have extre...

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
Inventor 刘星成张源斌
Owner SUN YAT SEN UNIV