Dynamic asynchronous BP decoding method

A dynamic and decoding technology, applied in the research field of LDPC code decoding algorithm design and implementation, can solve problems such as slow convergence, and achieve the effect of accelerating convergence and improving decoding performance.

Inactive Publication Date: 2012-07-18
SUN YAT SEN UNIV
View PDF3 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The BP algorithm is a synchronous message update algorithm, and its convergence is slow, which is far from satisfying the needs of many applications that require fewer iterations.

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
  • Dynamic asynchronous BP decoding method
  • Dynamic asynchronous BP decoding method
  • Dynamic asynchronous BP decoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] The present invention provides a dynamic asynchronous message update strategy for the BP decoding algorithm, which is based on the maximum message residual from the variable node to the check node and supplemented by the instability judgment of the variable node, effectively locating the variable node that needs to be updated first To the check node message, and effectively use the check function of the related check node.

[0039] Let N(v i ) represents the node v with the variable i All connected check nodes (check equations), N(v i )\c j It means to remove the check node c j Outside with the variable node v i All connected check nodes (check equation); N(c i ) represents and check node (check equation) c i All connected variable nodes, N(c i )\v j Then it means to remove the variable node v j and check node (check equation) c i All connected variable nodes. The message function of the interconnected variable nodes and check nodes can be defined as wher...

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 aims at a BP decoding algorithm of a low density parity check (LDPC) code and provides an algorithm for dynamically constructing an asynchronous update sequence judged by the instability of variable nodes, wherein the algorithm is based on the maximum information residual between variable nodes and check nodes which are updated and variable nodes and check nodes not updated. The principle that convergence can be controlled by controlling the difference value between two adjacent calculation results in error estimation through fixed point iterative algorithm is used in the algorithm, message calculation from the variable nodes to the check nodes is selected as an iterated function, and the check function of the check nodes is fully used. The messages required to be optionally updated are better positioned by the algorithm, and a trap set in the LDPC is more quickly overcome, so the iterations required during decoding are reduced, and the aims of quickening convergence and improving the decoding performance through the algorithm are fulfilled.

Description

technical field [0001] The invention belongs to the research field of LDPC code decoding algorithm design and realization, is a dynamic asynchronous message update strategy capable of accelerating the convergence of BP decoding algorithm, and is a dynamic asynchronous BP decoding method, that is, IVC RBP algorithm. Background technique [0002] Since the LDPC code was discovered again in 1996, its decoding algorithm (BP algorithm) has been favored by the field of coding and decoding because of its simple implementation and linear increase in decoding complexity, and it is called a hot spot in this field. [0003] The BP decoding algorithm is a message iterative algorithm. Messages between nodes are transmitted back and forth along the edges of the Tanner graph corresponding to the LDPC code. The message transmission mainly includes two steps of horizontal calculation and vertical calculation. The horizontal calculation is the verification node c i to variable node v j mess...

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 Applications(China)
IPC IPC(8): H03M13/11
Inventor 刘星成龚怡
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap