Method for consitituting sparse generative matrix and method for coding low-density block check code
A technology for generating matrices and sparse matrices, which is applied in the fields of constructing sparse generating matrices, coding of low-density block check codes, and channel coding.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0049] specific implementation
[0050] The present invention will be described in further detail below in conjunction with the accompanying drawings and specific embodiments.
[0051] figure 1 A simple example of using a bipartite graph to represent a low density check code is given. LDPC code is a kind of linear block code based on sparse parity check matrix. In 1981, Tanner proposed to use a bipartite graph to represent a low-density linear block code. Since then, the bipartite graph has become the main tool for analyzing LDPC codes. Assuming an LDPC code, the information bit length is K, the code length is N, and the parity bit is M=N-K, then the parity check matrix H of the code is a matrix with a size of M*N. The bipartite graph of the parity check matrix H is described as follows: the N nodes on the bottom of the bipartite graph represent N codewords and become message nodes (massage nodes); the M nodes on the top represent M check formulas and are called check nodes...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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