Low complexity quasi-cyclic LDPC code designing method based on mask operation
An LDPC code, low-complexity technology, applied in the field of channel coding, which can solve the problem of high coding complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] The present invention will be described in detail below in conjunction with specific embodiments.
[0037] Based on the design of the finite field method, the present invention proposes a quasi-cyclic LDPC code design method based on the finite field mask in combination with the property that the Tam structure can perform simple recursive coding.
[0038] Such as figure 1 As shown, assume that in the finite field GF(2 q ) to construct a check matrix, the complete check matrix H (1) size is (q-1) 2 ×(q-1) 2 , H FF is a parity check matrix constructed according to the specified code length and code rate, its size is ML×NL, E(H FF ) is its corresponding exponent matrix, the matrix size is M×N, E(H FTM ) is the exponential matrix of the quasi-cyclic LDPC code constructed by the FTM (Finite Field, Tam, Masking) method proposed by the present invention, H FTM Its corresponding check matrix, B(H) is the base matrix corresponding to matrix H, that is, the non-zero elemen...
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