QC-LDPC Check Matrix Encoding With Identifier Padding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Low-Density Parity-Check (LDPC) codes, particularly quasi-cyclic LDPC (QC-LDPC) codes, do not fully utilize redundant information bits, leading to suboptimal performance in encoding and decoding processes, especially in 5G communications systems where message identification and processing efficiency are critical.
Innovation Solution
The proposed solution involves constructing a QC-LDPC check matrix that incorporates an identifier sequence, which is used to enhance the identification degree of the encoded codeword, thereby improving information transmission relevance and processing efficiency. This is achieved by determining the size of a shift matrix based on the information and identifier sequences, constructing the check matrix accordingly, and padding the identifier sequence into redundant information bit locations, allowing for more effective use of padding bits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If zero-padding method is used to fill redundant information bit locations, then the check matrix construction is simple, but the padding bits are not fully utilized leading to suboptimal performance
Solution Approach 1:
The patent changes the content parameter of padding bits from fixed zero values to dynamic identifier sequences. The check matrix construction process is modified to insert identifier sequences (such as RNTI, PCI, or other identification information) into the redundant information bit locations instead of zeros. This parameter change enables the padding bits to carry meaningful identification information, improving the reliability and performance of encoding and decoding while maintaining the quasi-cyclic structure of the check matrix.
2Reliability
If identifier sequence is padded into redundant information bit locations, then the identification degree of encoded codeword is enhanced, but the check matrix construction complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-generating identifier sequences (such as RNTI, PCI, or other identification information) before the check matrix construction process. These identifier sequences are prepared in advance and then directly inserted into the redundant information bit locations during check matrix construction. This preliminary preparation simplifies the overall construction process by separating the identification information generation from the matrix construction logic, reducing the actual construction complexity while enhancing message identification capability.
3Ease of operation
If traditional zero-padding is used, then the encoding process is straightforward, but information transmission pertinence is reduced
Solution Approach 1:
The patent applies self-service by enabling the padding bits to serve dual purposes: maintaining the structural integrity of the check matrix and carrying identification information. Instead of being purely filler zeros, the padding bits now contain identifier sequences that help the receiving end identify and process the transmitted information more effectively. This self-service approach allows the encoding process to simultaneously achieve structural simplicity and information transmission pertinence without requiring separate identification mechanisms.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
Embodiments of this application disclose an encoding method, an encoding apparatus, a decoding method, and a decoding apparatus. The encoding method includes: determining a size of a shift matrix based on a length of an information sequence and a length of an identifier sequence; constructing a check matrix based on the size of the shift matrix and a base matrix; and performing low-density parity-check LDPC encoding on the information sequence and the identifier sequence based on the check matrix; where the identifier sequence is a non-all-zero sequence. In the embodiments of this application, a function of an LDPC check matrix can be extended, and an identification degree of an encoded codeword can be improved.