QC-LDPC (quasi-cyclic low-density parity-check codes) coder and coding method
An encoder and encoding technology, which is applied in the field of LDPC encoders and encoding, can solve the problems of application limitations, no construction method given, code rate and code length cannot be flexibly selected, and achieve good performance.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0040] 1. Basic concepts
[0041] 1. Tanher diagram
[0042] Tanner graph is a bidirectional graph, which can be represented by G={(V, E)}, where V is a collection of nodes, V=V b ∪V c . For a parity check matrix whose dimension is M*N, V b =(v 0 , v 1 ,...,v N-1 ) is called a variable node, which corresponds to the columns of the parity check matrix and corresponds to the bits in the codeword; V b =(c 0 , c 1 ,...,c M-1 ) is called a check node, which corresponds to the row of the check matrix and corresponds to the check relationship. E is the set of edges connected between nodes, there is no edge connection between nodes of the same type, and only edges exist between two types of nodes.
[0043] 2. Ring length
[0044] If the i-th row and the j-th column element of the check matrix are non-zero, there is an edge connecting the i-th variable node and the j-th check node in the Tanner graph. The number of edges connected to a node is called the degree of the node...
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