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

Mixed modified weighted bit-flipping LDPC decoding algorithm

A technology of weighted bit flipping and decoding algorithm, which is applied in the field of LDPC decoding algorithm with mixed modified weighted bit flipping, and can solve problems such as gaps

Active Publication Date: 2013-09-04
SOUTH CHINA UNIV OF TECH
View PDF7 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] However, the performance of the above-mentioned series of weighted bit flipping algorithms is still far behind that of soft-decision decoding algorithms, especially for non-regular LDPC codes

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
  • Mixed modified weighted bit-flipping LDPC decoding algorithm
  • Mixed modified weighted bit-flipping LDPC decoding algorithm
  • Mixed modified weighted bit-flipping LDPC decoding algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0046] The invention belongs to a mixed modified weighted bit-flipping LDPC decoding algorithm (Mixed Modified Weighted Bit-Flipping, MM-WBF) in the technical field of digital information transmission, and the specific implementation of the algorithm is now described.

[0047] Such as figure 1 Shown is the specific implementation of the algorithm of the present invention for (L, K) LDPC codes, wherein L represents the code word length, and K represents the information bit length. Set H=[H mn ] is the parity check matrix of the LDPC code, that is, a matrix of W rows and L columns composed of 0 and 1, W≥L-K. N(m)={n:H mn =1} means all bit nodes participating in check node m, M(n)={m:H mn =1} means all check nodes that have bit node n participating. N(m)\n represents all other bit nodes participating in check node m except n, and M(n)\m represents all other check nodes participating in bit node n except m.

[0048] Let LDPC code word c={c 1 ,c 2 ,...,c L} through x n =2c...

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 mixed modified weighted bit-flipping LDPC decoding algorithm. The mixed modified weighted bit-flipping LDPC decoding algorithm comprises a first step of initializing a decoder and measuring and calculating parameters, a second step of calculating syndromes of a check matrix, wherein if all syndromes are zero, the decoding is successfully achieved and then the process is finished and if not all syndromes are zero, a third step is carried out, the third step of calculating the judgment standard value En1 of a main algorithm and the judgment standard value En2 of an auxiliary algorithm according to the parameters of the first step and a verifying result of the second step, a fourth step of defining a bit corresponding to the position p as an error bit according to the judgment standard value En1 of the main algorithm and defining a bit corresponding to the position q as an error bit according to the judgment standard value En2 of the auxiliary algorithm, a fifth step of rectifying the bit corresponding to the position p and the bit corresponding to the position q at the same time or only rectifying the bit corresponding to the position p, and a sixth step of repeating the second step to the fifth step, wherein when the decoding is successfully achieved or a maximum number of iterations is reached, the iteration is stopped, and a decoding sequence is output. The mixed modified weighted bit-flipping LDPC decoding algorithm has the advantages that the decoding property is good, computation complexity is low, and hardware is easy to achieve.

Description

technical field [0001] The present invention relates to a mixed modified weighted bit-flipping LDPC decoding algorithm (Mixed Modified Weighted Bit-Flipping, MM-WBF) technology in the technical field of digital information transmission, in particular to a mixed modified weighted bit-flipping LDPC decoding algorithm. Background technique [0002] With the rapid development of social economy, the demand for personal communication is getting higher and higher, which not only requires "anytime, any place to talk to anyone", but also requires communication technology "broadband, real-time and multimedia"; As an important part of communication technology, "decoding" technology also faces higher requirements; Low-Density Parity-Check (LDPC) code is a linear code defined by a sparse parity check matrix, which was first introduced by Gallager in the 1960s It was proposed in his doctoral dissertation; but limited to the technical conditions at that time, it could not be practically ap...

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/11H04L1/00
Inventor 王一歌黄海艺韦岗
Owner SOUTH CHINA UNIV OF TECH
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