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

Method for performing correction on belief propagation algorithm

A technology of belief propagation and algorithm, applied in the direction of error correction/detection using block codes, data representation error detection/correction, error detection coding using multi-bit parity bits, etc., which can solve problems such as high error leveling

Inactive Publication Date: 2016-05-11
CHINA ACADEMY OF ELECTRONICS & INFORMATION TECH OF CETC
View PDF2 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The technical problem to be solved by the present invention is to provide a method for correcting the belief propagation algorithm to solve the problem that the belief propagation algorithm in the prior art has a high error floor in the decoding process

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
  • Method for performing correction on belief propagation algorithm
  • Method for performing correction on belief propagation algorithm
  • Method for performing correction on belief propagation algorithm

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0065] Utilize the random LDPC code Mackay (504,252) (abbreviated as Mackay504) to instantiate the inventive algorithm, and construct a correspondingly modified belief propagation LDPC decoder. The maximum number of iterations for BP decoding is 50, and the maximum number of iterations for flipping decoding is 30. The backtracking threshold τ of the BB-BP algorithm is set to 15. The number of elements in the unstable trap set is set to j=4 and j=9 respectively for the simulation test of the algorithm. The test data is transmitted through the AWGN channel after BPSK modulation, the mean value of the noise is 0, and the variance is N0 / 2.

[0066] See figure 2 , compared to the original BP algorithm, both the UPF-BP (invented algorithm) and the BB-BP algorithm have effectively reduced the error floor of Mackay504, and the UPF-BP algorithm of the present invention has the best decoding performance. For the two codewords used in the simulation, when j=4, UPF-BP algorithm achiev...

example 2

[0071] Using the irregular LDPC code IEEE802.16 (576,288) (abbreviated as IEEE576) to instantiate the inventive algorithm, construct a corresponding modified belief propagation LDPC decoder. The maximum number of iterations for BP decoding is 50, and the maximum number of iterations for flipping decoding is 30. The backtracking threshold τ of the BB-BP algorithm is set to 15. The number of elements in the unstable trap set is set to j=4 and j=9 respectively for the simulation test of the algorithm. The test data is transmitted through the AWGN channel after BPSK modulation, the mean value of the noise is 0, and the variance is N0 / 2.

[0072] See image 3 , compared with the previous BP algorithm, both the UPF-BP and BB-BP algorithms effectively reduce the error floor of IEEE576, and the UPF-BP algorithm of the present invention has the best decoding performance. For the two codewords used in the simulation, when j=4, UPF-BP algorithm achieves decoding performance equivalent...

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 method for performing correction on a belief propagation algorithm, comprising steps of obtaining an initial parameter when a iterations is k, updating bit information outputted by a bit node n and verification information outputted by a verification node m according to an initial parameter, enabling k=k+1, updating hard decision information of various bit nodes in order to obtain the value of the nth element of the hard decision vector at the kth interation and outputting a coding sequence according to a calculated value or executing flipping decoding. The invention can effectively mark the key trap set element scale causing the decoding leveling, effectively reduces the fault leveling of the simulation code work, has lower calculation complexity and good coding possibility and can better satisfy the high reliability transmission requirement of other communication systems like the optical transmission.

Description

technical field [0001] The invention relates to the field of communication technology, in particular to a method for correcting a belief propagation algorithm. Background technique [0002] When decoding with Belief Propagation (BP), LDPC code (Low Density Parity Check Code, Low Density Parity Check Code; a channel error correction code) can obtain good decoding performance close to the Shannon limit, and has been extensively studied. However, since the belief propagation algorithm has a high error floor in the decoding process, it cannot effectively guarantee occasions such as optical communication that require highly reliable data transmission. Therefore, how to reduce the error floor of LDPC codewords is a key issue in its application in command and control systems. The error floor that appears in the BP decoding process is mainly caused by the trap set contained in the parity check matrix of the LDPC code. [0003] The trap set is an inherent structure in the parity ch...

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
CPCH03M13/1111H03M13/1148
Inventor 马克祥黄照祥谢宇宝朱兴国魏立柱李丹孟宏伟
Owner CHINA ACADEMY OF ELECTRONICS & INFORMATION TECH OF CETC
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