LDPC Parity Check Matrix Selection for Flexible Code Length
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low density parity check (LDPC) codes in wireless communication networks have limitations in flexibility of code length and rate, and decoding parallelism and throughput due to a fixed maximum lifting size and large dimension of the base graph.
Innovation Solution
The proposed solution involves determining a target parity check matrix and base graph from a second parity check matrix set, extracted from a first set, to perform LDPC encoding and decoding, allowing for flexible code length and rate, and enhancing decoding parallelism and throughput by supporting higher lifting sizes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a fixed maximum lifting size of 384 is used for LDPC code, then the base graph dimension is manageable, but the code length and code rate flexibility are limited and decoding parallelism is restricted
Solution Approach 1:
The patent segments the base graph into multiple sub-graphs, where each sub-graph corresponds to a specific lifting size range. This allows the system to select and use only the necessary sub-graph for the current transmission requirements, rather than maintaining a single large base graph that supports all possible lifting sizes. The segmentation enables flexible adaptation to different code lengths and rates while keeping the active base graph dimension manageable.
Solution Approach 2:
The patent introduces a new dimension of organization by creating multiple base graphs arranged in a hierarchical structure with different lifting size capabilities. Instead of expanding a single base graph in one dimension, the system adds base graphs along a new dimension of lifting size support, allowing selective combination and usage based on requirements.
2Productivity
If a fixed maximum lifting size of 384 is used for LDPC code, then the base graph dimension remains controlled, but the decoding parallelism and data transmission throughput are limited
Solution Approach 1:
The patent implements a dynamic base graph selection mechanism that adapts the base graph dimension and structure based on the required lifting size. The system dynamically selects from multiple pre-configured base graphs with different lifting size capabilities, allowing the decoding parallelism to be optimized for each specific transmission scenario without permanently maintaining the complexity of supporting the maximum lifting size of 1536 in all cases.
3Adaptability or versatility
If multiple base graphs with different lifting sizes are maintained to support flexible code length, then the adaptability improves, but the system complexity and memory requirements increase
Solution Approach 1:
The patent segments the overall base graph requirement into multiple smaller, manageable sub-graphs stored in a library. Each sub-graph is optimized for a specific lifting size range. The segmentation allows the system to store multiple specialized base graphs rather than one large general-purpose base graph, reducing the total memory footprint while maintaining support for various lifting sizes through selective retrieval and usage.
Data Source
AI summary
A low density parity check encoding method, including: determining a target parity check matrix, where the target parity check matrix belongs to a second parity check matrix set, and a base graph of the second parity check matrix set is extracted from a base graph of a first parity check matrix set and performing low density parity check encoding on data to be transmitted according to the target parity check matrix and a target lifting size.