Check patentability & draft patents in minutes with Patsnap Eureka AI!

LDPC decoding method based on hierarchical minimum sum algorithm

An algorithm and decoding technology, applied in the field of LDPC decoding based on the hierarchical minimum sum algorithm, can solve the problems of the iterative decoding positive feedback is not obvious, difficult to update, reduce the performance of the decoding algorithm, etc., to weaken the external information shock effect of phenomenon

Active Publication Date: 2018-12-11
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The present in this patented technology improves error correction codes by adding weights that can be adjusted based upon factors like data size or frequency content (the number of times it has been repeated). This helps prevent errors from happening during transmission over communication channels such as wireless networks. Additionally, there are also improvements made for Layer 3 protocols which use different types of messages called message blocks instead of plaintext. These modifications help reduce interference between signals sent through these systems while still maintaining their effectiveness at transmitting them correctly. Overall, this innovative technique enhances error detection capabilities without making complex calculations more difficult than previous methods.

Problems solved by technology

Technological Problem: Current methods for deciding whether certain bits should be added during data processing involve complicated computations involving multiplication and division operators. These techniques require significant computational resources due their efficiency compared to simpler ones like binary search tree 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
  • LDPC decoding method based on hierarchical minimum sum algorithm
  • LDPC decoding method based on hierarchical minimum sum algorithm
  • LDPC decoding method based on hierarchical minimum sum algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] In order to make the purpose, technical solution, design method and advantages of the present invention clearer, the present invention will be further described in detail through specific embodiments in conjunction with the accompanying drawings. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0037] For ease of understanding, the decoding method based on the minimum sum algorithm of the present invention is described below in conjunction with the LDPC parity check matrix represented by the tanner graph.

[0038] The Tanner graph is a bipartite graph, which is divided into check nodes and variable nodes. According to the check matrix, the tanner graph representation of the LDPC code can be constructed. The Tanner graph and the check matrix have the following correspondence: the Tanner graph has N variable nodes (or information nodes) and M check nodes, correspondin...

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 an LDPC decoding method based on a hierarchical minimum sum algorithm. This method divides the check matrix of LDPC into several check nodes according to the rows, divided intovariable nodes by column, and when the element of the parity matrix of the LDPC is 1, it is assumed that the check node corresponding to the row in which the element is located and the variable node corresponding to the column in which the element is located have connections. The method is characterized in that when the number of iterations does not reach a predetermined maximum number of iterations or the LDPC checksum is not a total zero vector, the following steps are repeatedly executed: the variable node updates the information transmitted to the connected check node according to the weighted average of the received two external information values. The checking node updates the information transmitted to the connected variable node according to the weighted average value of the received two external information values. The posterior probability of the variable node is used for decoding decision. The decoding method of the invention can improve the decoding performance and is easyto realiz by hardware.

Description

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

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
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
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