Local dynamic BP decoding method for LDPC codes

A kind of LDPC code and local technology, applied in the field of LDPC code decoding, can solve the problems of increasing calculation and search complexity, and achieve the effect of improving decoding performance

Inactive Publication Date: 2020-05-19
王海林
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The SVNF-RBP algorithm can greatly improve the performance of BP decoding, but it increases a lot of calculation and search 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
  • Local dynamic BP decoding method for LDPC codes
  • Local dynamic BP decoding method for LDPC codes
  • Local dynamic BP decoding method for LDPC codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention will be further described in detail below in conjunction with the embodiments and the accompanying drawings, but the embodiments of the present invention are not limited thereto.

[0045] The present invention is a local dynamic decoding method based on LDPC codes, and is aimed at the dynamic BP decoding method (LRBP) of LDPC codes. The method proposes that the generation of residuals has timeliness, and establishes a calibration by finding the local maximum residuals. Update sequence of messages from test nodes to variable nodes.

[0046]Let N(v i ) represents the node v with the variable i All connected check nodes, N(v i )\c j Then it means that with the variable node v i Connected excluding check node c j All other check nodes of ; N(c i ) represents and check node (check equation) c i All connected variable nodes, N(c i )\v j Then it means that with the check node c i Connected excluding variable nodes v j All other variable nodes f...

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

Aiming at the dynamic BP decoding algorithm of the LDPC code, the invention provides a local dynamic update decoding method (LRBP) based on the LDPC code, and the method adopts the message update based on the local residual error, thereby effectively improving the BP decoding performance within a small number of iterations, and surpassing other dynamic BP decoding algorithms. Different from the conventional dynamic BP decoding method, the LRBP method considers that the residual error has timeliness, so that only the nearest residual error in time is paid attention to, and the next message to be updated is determined. The method has the advantages that the latest message can be always used for updating the message, the convergence of the algorithm can be influenced, and the convergence speed of the BP decoding algorithm is effectively improved.

Description

technical field [0001] The invention relates to the technical field of LDPC code decoding, in particular to a local dynamic decoding method based on LDPC codes. Background technique [0002] Since the LDPC code was discovered again in 1996, its decoding algorithm (flooding BP algorithm) has become the focus of the field of encoding and decoding because of its simple implementation and linear increase in decoding complexity. The dynamic BP decoding algorithm represented by the SVNF-RBP algorithm increases the residual calculation and search complexity, but also greatly improves the decoding performance of the BP algorithm. [0003] The SVNF-RBP decoding algorithm is an asynchronous dynamic message iterative algorithm, each time according to a largest check node to variable node message residual, locate the next check node to variable node message to be updated. The message update is based on the order of the largest residual found each time, and is passed back and forth alon...

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
CPCH03M13/1125
Inventor 王海林
Owner 王海林
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