Supercharge Your Innovation With Domain-Expert AI Agents!

A Fast Convergent Decoding Algorithm for ldpc Codes

A technology of LDPC code and decoding algorithm, which is applied in error detection coding, coding, and code conversion using multi-bit parity bits, which can solve problems such as performance degradation, and achieve the effect of accelerating convergence speed and reducing the number of iterations.

Active Publication Date: 2021-08-10
NORTHWESTERN POLYTECHNICAL UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, in order to further reduce the decoding complexity, the Minimal Sum (MS) algorithm with lower complexity came into being, which greatly reduces the complexity, but at the same time the performance is also reduced

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
  • A Fast Convergent Decoding Algorithm for ldpc Codes
  • A Fast Convergent Decoding Algorithm for ldpc Codes
  • A Fast Convergent Decoding Algorithm for ldpc Codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] The present invention will be further described below in conjunction with the accompanying drawings and embodiments, and the present invention includes but not limited to the following embodiments.

[0034] The present invention comprises the following steps:

[0035] (1) Decoding initialization: For the received real number sequence (1≤i≤N) whose length is N, the initialization information of the i-th symbol is:

[0036]

[0037] (2) If the obtained hard decision result is invalid, perform an iterative process of decoding, including two steps of variable node update and check node update.

[0038] 1. Variable node update

[0039]

[0040] In the formula, C(i) represents the location set of non-zero elements in the i-th column of the matrix.

[0041] 2. Check node update

[0042]

[0043] In the formula It is the check node update method adopted in the minimum sum algorithm. It uses partial waveform fitting method to simplify the update of check nodes in ...

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 present invention provides a fast-convergent LDPC code decoding algorithm. At the beginning of decoding, the decoder is initialized, and the number of iterations is 1; then the hard judgment output of the first iteration variable node is calculated to detect whether it is legal, and the legal output As a result, the iteration ends, otherwise the next iteration will be performed. During each iteration, the update of the check node adopts the weighted dynamic minimum sum algorithm proposed in the present invention, p 1 ,p 2 The selection of is obtained by the Monte Carlo method; every time an update is completed, the number of iterations is increased by 1. Before the next iteration starts, the variable node must calculate the hard decision output every time and judge whether the codeword is correct. If all the codewords are correct, stop the iteration. The code ends, or the preset maximum number of iterations is reached. The invention accelerates the convergence speed and lowers the bit error rate.

Description

technical field [0001] The invention belongs to the field of communication channel coding and relates to a decoding method. Background technique [0002] In the process of data transmission, various errors are often caused. These errors are often caused by unsatisfactory channels, and the existence of these errors has a serious impact on the rate and reliability of information transmission. In order to solve the reliability problem in data transmission, the method of channel coding is usually adopted. LDPC code is a common channel coding technology with strong error correction ability. [0003] In general, the LDPC codeword is obtained by encoding the generator matrix G, that is, multiplying the message packet sequence by G to obtain the encoded codeword. The complexity of this encoding method is related to the number of non-zero elements in the G matrix, and the matrix G is usually is dense, so the complexity of encoding using matrix G is high. Using sparse matrix H codin...

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 Patents(China)
IPC IPC(8): H03M13/11
CPCH03M13/1105H03M13/1148
Inventor 王伶邓康杨欣谢坚张兆林张捷汪跃先陶明亮粟嘉韩闯邢自健宫延云刘龙
Owner NORTHWESTERN POLYTECHNICAL UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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