LDPC Base Matrix Generation With Fixed Puncturing Patterns
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communications networks with limited frequency resources, the reliability and effectiveness of information transmission are compromised due to high computational complexity and slow convergence in decoding LDPC codes, especially when using incremental redundancy, which is exacerbated by poor puncturing patterns leading to increased decoding errors.
Innovation Solution
A method for generating a base matrix of an LDPC code with a fixed puncturing pattern is introduced, involving transformations of an initial matrix to determine a check bit part and information bit part, ensuring performance by transforming the base matrix based on a predetermined pattern, thereby reducing decoding errors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If incremental redundancy with puncturing is used to adapt to different channel environments, then adaptability is improved, but decoding error probability increases due to poor puncturing patterns
Solution Approach 1:
The patent pre-generates multiple base matrices with different fixed puncturing patterns before transmission. Each base matrix is designed with optimized puncturing patterns that guarantee minimum performance standards. When transmitting, the appropriate pre-generated base matrix is selected based on channel conditions, avoiding the need to create puncturing patterns on-the-fly and ensuring reliability from the start.
Solution Approach 2:
The patent changes the fundamental parameter of puncturing pattern design from dynamic/ad-hoc to fixed/pre-determined. By establishing fixed puncturing patterns during base matrix generation, the system ensures that each pattern meets minimum performance criteria. This parameter change transforms the unreliable dynamic pattern selection into reliable static pattern selection.
2Productivity
If dynamic puncturing patterns are used for rate adaptation, then productivity is improved, but device complexity increases due to transformation operations
Solution Approach 1:
The patent performs the complex transformation operations in advance during base matrix generation. Multiple base matrices with different puncturing patterns are pre-computed and stored. During actual transmission and decoding, the system only needs to select the appropriate pre-generated base matrix, avoiding real-time transformation operations and reducing device complexity.
Solution Approach 2:
Instead of performing dynamic transformations on the initial check matrix during decoding, the patent creates copies (multiple pre-generated base matrices) of the coding structure with different fixed puncturing patterns. The receiver simply selects the appropriate copy based on the transmitted rate, eliminating the need for complex real-time transformation operations.
3Reliability
If fixed puncturing patterns are used in base matrix generation, then decoding reliability is improved, but adaptability to varying rates decreases
Solution Approach 1:
The patent segments the rate adaptation function into multiple fixed puncturing patterns, each embedded in a separate pre-generated base matrix. Instead of one flexible dynamic pattern, the system divides adaptability into discrete fixed patterns (e.g., different puncturing ratios). This segmentation allows the system to maintain fixed pattern reliability while achieving adaptability through selection among segments.
Solution Approach 2:
The patent makes each pre-generated base matrix universal for its specific rate by designing fixed puncturing patterns that work optimally for particular rate scenarios. The set of base matrices collectively provides multi-functionality, covering different rate requirements. Each base matrix is specialized for its rate, but together they provide universal rate adaptation capability.
Data Source
AI summary
The present disclosure relates to a communications field, and discloses a method for generating a base matrix of an LDPC code, an encoding/decoding method, and a device, to resolve a problem that a probability of a decoding error increases because performance of a transformed check matrix cannot be ensured due to a poor puncturing pattern. A specific solution is as follows: A size of a check bit part of a base matrix is determined based on a required minimum bit rate, and the check bit part of the base matrix is determined based on the size of the check bit part and an initial matrix. The initial matrix is a matrix with a size of m×m that has a bidiagonal structure, the check bit part is a k-order transformation matrix Hk obtained after the initial matrix is transformed k times, k meets 2k−1m<T≤2km, and T is the size of the check bit part. An information bit part of the base matrix is determined based on the check bit part, and the base matrix is obtained based on the check bit part and the information bit part. The present disclosure is used in an encoding/decoding process.