PBRL LDPC Base Matrix Construction Using Cycle Count Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low-Density Parity-Check (LDPC) codes face performance limitations due to complex coding and time delays, particularly because the structure of the check matrix significantly impacts code performance, necessitating an efficient method to construct the base matrix based on cycle length distributions.
Innovation Solution
A method for constructing a base matrix of a Protograph-based Raptor-Like (PBRL) LDPC code by determining candidate sub-matrices based on a QR-QC-LDPC code, counting cycles of preset lengths, and selecting sub-matrices with minimal cycle counts to optimize the check matrix structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the check matrix structure is optimized based on cycle length distributions to improve LDPC code performance, then error correction capability is improved, but the coding complexity increases
Solution Approach 1:
The check matrix is divided into multiple sub-matrices, where each sub-matrix corresponds to a specific cycle length distribution. This segmentation allows the system to optimize for different cycle lengths independently while maintaining overall code performance, reducing the complexity of finding a single optimal matrix structure.
Solution Approach 2:
The invention changes the structural parameters of the check matrix by adjusting cycle length distributions across different sub-matrices. By modifying parameters such as the number of rows, columns, and non-zero element patterns in each sub-matrix, the system achieves better error correction capability while managing coding complexity through structured parameter optimization.
2Reliability
If the code length is increased to demonstrate LDPC code superiority in performance, then error correction performance is improved, but the time delay of coding increases
Solution Approach 1:
The long code is divided into multiple segments corresponding to different sub-matrices with specific cycle length distributions. This segmentation enables parallel processing of different code segments, reducing the overall coding time delay while maintaining the performance benefits of long code lengths through the aggregated error correction capability of all segments.
Data Source
AI summary
The present disclosure relates to a method, system, and non-transitory computer-readable storage medium for constructing a base matrix of a PBRL LDPC code, comprising: determining at least one candidate sub-matrix of a PBRL LDPC code based on a base matrix of a QR-QC-LDPC code; obtaining at least one count of cycles with at least one preset length for each of the at least one candidate sub-matrix; and determining a first sub-matrix of the base matrix of the PBRL LDPC code based on the at least one count of cycles.