Method for constructing LDPC code check matrix
A technology of LDPC code and check matrix, which is applied in the construction field of LDPC code check matrix, can solve problems such as the existence of six loops, and achieve the effect of low bit error rate and reducing the probability of wrong decoding.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0042] figure 1 Shows the parity check matrix of a (10, 2, 4) LDPC code H A diagram of the corresponding relationship with the bidirectional graph. There are 10 nodes below the graph, and each node represents the information bit of the codeword, called an information node{ x j , j =1,2,...,10}, is the bit of the codeword, corresponding to each column of the parity check matrix, and the information node is also called a variable node; the five nodes on the upper side of the bidirectional graph represent the parity check equation, each node Represents a check set of codewords, called a check node { z i , i =1,2,...,5}, corresponding to each row of the check matrix; there is a continuous edge between the left and right nodes corresponding to the "1" element in the check matrix.
[0043] figure 2 Check matrix for a (8,4) LDPC code H Schematic diagram of the four rings in . In the figure, the dotted line represents a short loop with a length of 4, corresponding to the...
PUM

Abstract
Description
Claims
Application Information

- Generate Ideas
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
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