Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Low-complexity dynamic asynchronous BP decoding method

A low-complexity and dynamic technology, applied in the field of LDPC code decoding, can solve the problems of high complexity, slow convergence, iteration times, and burden, and achieve the effect of improving decoding performance and faster algorithm convergence.

Inactive Publication Date: 2012-07-18
SUN YAT SEN UNIV
View PDF2 Cites 13 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 slow convergence is far from satisfying the needs of many applications that require fewer iterations.
Although the existing dynamic asynchronous BP algorithm has good decoding performance, it brings a lot of burden to the decoding because of its high complexity.

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
  • Low-complexity dynamic asynchronous BP decoding method
  • Low-complexity dynamic asynchronous BP decoding method
  • Low-complexity dynamic asynchronous BP decoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention is aimed at a low-complexity dynamic asynchronous BP decoding method (V-RBP) for LDPC codes. The dynamic asynchronous message update strategy in the method includes a positioning method that utilizes the maximum fluctuation of the variable node likelihood A form of message passing for message computation from test nodes to variable nodes.

[0045] Let N(v i ) represents the node v with the variable i All connected check nodes, 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; 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 In addition to check node c i All connected variable nodes. The message function of the interconnected variable nodes and check nodes can be defined as where m means all messages. Prior probability of the channel (p v (0),p v (1) represent the probability ...

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 provides a low-complexity dynamic asynchronous information updating strategy aiming at the BP decoding algorithm of LDPC (Low Density Parity Check) codes. The low-complexity dynamic asynchronous information updating strategy comprises the steps of including a simple and direct positioning method based on the maximum fluctuation of the LLR (Log Likelihood Rate) of variable nodes and an information transmission form of utilizing the information calculation from two-step check nodes of check nodes to the variable nodes to the greatest degree, utilizing the principle that the convergence can be controlled by the control of the difference of the two adjacent calculation results in the error evaluation through the fixed-point iteration algorithm, selecting the LLR calculation of the variable nodes as an iterative function, and utilizing the check function of the check nodes to the greatest degree. According to the method, the variable nodes needing to be updated preferentially are positioned simply and directly, a trap set in the LDPC code words can be overcome rapidly, so that the iterations needed in decoding are reduced, the purpose that the algorithm can be converged rapidly can be achieved, and simultaneously, the decoding performance is promoted greatly.

Description

technical field [0001] The invention belongs to the technical field of LDPC code decoding, and in particular relates to a low-complexity dynamic asynchronous message update strategy capable of accelerating the convergence of BP decoding algorithms, that is, a low-complexity dynamic asynchronous BP decoding method. Background technique [0002] Since the LDPC code was discovered again in 1996, its decoding algorithm (BP algorithm) has become the focus of the field of coding and decoding because of its simple implementation and linear increase in decoding complexity. [0003] The BP decoding algorithm is a message iterative algorithm. Messages between nodes are transmitted back and forth along the edges in the Tanner graph corresponding to LDPC codes. The message transmission mainly includes two steps: horizontal calculation and vertical calculation, in which horizontal calculation is correction Test point c i to variable node v j messaging for [0004] ...

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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com