QC-LDPC Base Matrix Generation for Low Error Floors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The construction of quasi-cyclic low-density parity-check code (QC-LDPC) parity check matrices with varying lifting factors often results in poor cycle length properties, leading to high error floors in data transmission, affecting the reliability of wireless communications systems.
Innovation Solution
A method for generating a low-density parity-check code base matrix by iteratively selecting and replacing matrix elements with shift factors to improve the cycle length property of the matrices, ensuring that the parity check matrices obtained through expansion have a good average cycle length property across all preset lifting factors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a same base matrix is used with multiple different lifting factors, then the device complexity is reduced and adaptability is improved, but the cycle length property deteriorates and error floor increases
Solution Approach 1:
The patent applies local quality by making different parts of the base matrix have different shift factor characteristics. Specifically, different columns of the base matrix are assigned different shift factors that are optimized for their local structure, allowing each column to contribute to good cycle length properties when expanded with various lifting factors. This local optimization resolves the contradiction by ensuring that regardless of which lifting factor is used, the resulting parity check matrix maintains good cycle length properties across all positions.
2Reliability
If shift factors are optimized for a specific lifting factor, then the cycle length property for that specific case is improved, but the adaptability to other lifting factors is reduced
Solution Approach 1:
The patent implements universality by designing shift factors that serve multiple lifting factors simultaneously. The shift factors are selected based on the column indices and matrix dimensions in a way that creates a universal pattern working well across different lifting factors. This allows the same base matrix with fixed shift factors to generate parity check matrices with good cycle length properties for multiple different code lengths, resolving the contradiction between optimization for a specific case and adaptability to other cases.
3Adaptability or versatility
If the base matrix size is increased to support longer code lengths, then the adaptability is improved, but the decoding complexity increases
Solution Approach 1:
The patent applies dynamics by enabling the system to adapt its effective complexity based on the required code length through the lifting factor mechanism. Rather than using a fixed large base matrix that would always incur high decoding complexity, the system uses a smaller base matrix that can be expanded dynamically to different sizes depending on the required code length. This resolves the contradiction by allowing adaptability to different code lengths while keeping the base matrix size and thus the inherent decoding complexity manageable.
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
A method and an apparatus for generating a low-density parity-check code basis matrix are disclosed. The method includes: obtaining a low-density parity-check code mother matrix (101); and generating a 1st matrix to a qth matrix one by one, where q is a preset positive integer (102). A Pth matrix in the 1st matrix to the qth matrix is generated in the following manner: selecting a to-be-replaced matrix element in a (P-1)th matrix, where the to-be-replaced matrix element is a matrix element having a value that is not -1 in the (P-1)th matrix; determining a Pth shift factor corresponding to the to-be-replaced matrix element; and replacing the to-be-replaced matrix element in the (P-1)th matrix with the Pth shift factor to obtain the Pth matrix whose cycle length property is better than a cycle length property of the (P-1)th matrix. When the basis matrix is generated by using the method, an average cycle length property of parity check matrices obtained by expanding the finally generated basis matrix based on preset lifting factors is relatively good. This can avoid a relatively high error floor of some parity check matrices.