LDPC Parity Bit Puncturing Using Row and Cycle Destruction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing LDPC code puncturing methods based on variable node degree distribution fail to effectively distinguish parity bits, leading to poor performance of high coding rate LDPC codes, especially in wireless local area networks, due to inefficient puncturing patterns and increased system resource overheads.
Innovation Solution
Determine puncturing priorities for parity bits using row destruction and/or cycle destruction on the LDPC code check matrix, optimizing the puncturing process to improve decoding performance by preferentially puncturing parity bits with lower impact on adjacent variable nodes and minimum cycles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If random puncturing is used to obtain high rate LDPC codes, then coding rate is improved, but decoding performance deteriorates due to non-optimized puncturing locations and increased overhead for signaling puncturing patterns
Solution Approach 1:
The patent changes the puncturing parameter from random selection to systematic selection based on variable node degrees. By calculating and comparing variable node degrees, the system determines optimal puncturing locations that maintain decoding performance while achieving the desired coding rate. This transforms the puncturing process from a stochastic operation to a deterministic one based on structural properties of the LDPC code.
Solution Approach 2:
The patent applies different treatment to different parts of the codeword based on local properties. Specifically, it identifies variable nodes with different degrees and selectively punctures those with lower degrees, while preserving nodes with higher degrees that are more critical for decoding convergence. This local differentiation optimizes the overall puncturing strategy.
2Measurement precision
If variable node degree distribution based puncturing is used, then parity bit distinction is improved, but implementation complexity increases due to additional calculations required
Solution Approach 1:
The patent performs preliminary calculation of variable node degrees before the puncturing process. By pre-computing the degrees and identifying which variable nodes correspond to parity bits, the system establishes a clear puncturing strategy in advance. This preliminary action simplifies the actual puncturing operation during encoding, as the decisions are already made based on the pre-analyzed degree distribution.
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
The present invention discloses a data sending method and apparatus, which resolves a problem that performance of a high coding rate LDPC code obtained in an existing puncturing manner based on a variable node degree distribution is relatively poor because in the puncturing manner, to-be-punctured parity bits that use LDPC codes cannot be effectively distinguished. The method includes: encoding, by using an LDPC code check matrix, an information bit that needs to be sent, to obtain a codeword sequence; determining a puncturing priority of each parity bit in the codeword sequence according to row destruction and/or cycle destruction, on the LDPC code check matrix, of a variable node corresponding to each parity bit; puncturing the codeword sequence according to the puncturing priority of each parity bit in the codeword sequence; and generating a bit sequence according to the punctured codeword sequence, and sending the bit sequence. In this way, performance of an obtained high coding rate LDPC code is improved.