LDPC Check Matrix Extension for Higher Code Rates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing low-density parity-check (LDPC) codes in communication systems, particularly in 5G and future 6G scenarios, face limitations in achieving code rates higher than the maximum supported by current base graphs, leading to performance losses when puncturing is used to reach higher code rates.
Innovation Solution
An encoding method that involves adding a new information column to the LDPC base graph, along with indication information, to construct a check matrix that enhances edge density and supports higher code rates without performance loss, using a correspondence of information columns and a base graph.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If puncturing is used to achieve higher code rates beyond the maximum supported by current base graphs, then code rate increases, but performance loss occurs
Solution Approach 1:
The base graph is segmented by separating information columns from check columns, allowing independent manipulation of information bits. The invention divides the base graph into original information columns and newly added information columns, enabling flexible code rate adjustment without affecting the fundamental check structure.
Solution Approach 2:
The invention extends the base graph by adding a new dimension - an additional information column - to the existing two-dimensional base graph structure. This transforms the base graph from a fixed configuration to an extended configuration that can support higher code rates while maintaining the original check columns and their relationships.
2Adaptability or versatility
If the base graph structure is modified to support higher code rates, then code rate capacity increases, but device complexity increases
Solution Approach 1:
The invention performs preliminary action by pre-defining the structure and correspondence relationships of information columns in the base graph. The mapping relationships between information columns and bits are established in advance, allowing the system to support higher code rates through straightforward extension rather than complex real-time calculations.
Solution Approach 2:
The invention uses copying by replicating the base graph structure to create an extended base graph. The new information column follows the same structural patterns and correspondence rules as the original information columns, allowing the system to leverage existing base graph designs while achieving higher code rate capacity.
3Adaptability or versatility
If a new information column is added to the base graph, then code rate increases beyond maximum supported, but manufacturing precision requirements increase
Solution Approach 1:
The invention changes parameters by modifying the base graph configuration - specifically adding a new information column and adjusting the correspondence relationships. The check matrix construction parameters are updated to reflect the extended base graph, allowing systematic support for higher code rates while maintaining construction precision through defined parameter sets.
Data Source
AI summary
An encoding method, a decoding method, and an apparatus. A transmit end obtains a first bit sequence, performs LDPC encoding on the first bit sequence based on a check matrix, to obtain a second bit sequence, and outputs the second bit sequence. Correspondingly, a receive end receives to-be-decoded information of the second bit sequence, and performs LDPC decoding on the to-be-decoded information of the second bit sequence based on the check matrix, to obtain K1 information bits. The check matrix is determined based on a correspondence of a first information column and a first base graph, and a quantity of columns in the first information column is determined based on the quantity K1 of information bits and a quantity K of information columns in the first base graph.