LDPC Base Graph Selection for Variable Block Length Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current low-density parity check (LDPC) codes in wireless communication systems face challenges in achieving high throughput with efficient hardware utilization, particularly in supporting a wide range of information block lengths and code rates, which is essential for next-generation networks like 5G New Radio.
Innovation Solution
The solution involves maintaining multiple LDPC base graphs, each associated with different information block length ranges, allowing for the selection of the appropriate base graph based on the information block length, code rate, and lift size to optimize encoding and decoding processes, thereby enhancing decoder resource utilization and throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single LDPC base graph is used to support all information block lengths, then device complexity is reduced, but manufacturing precision and performance optimization deteriorate
Solution Approach 1:
The patent divides the LDPC base graphs into multiple segments, each optimized for specific information block length ranges. Instead of using one universal base graph, the system maintains multiple base graphs (e.g., first base graph for certain length ranges, second base graph for other ranges) and selects the appropriate segment based on the input block length, thereby optimizing encoding performance for each segment while managing overall complexity.
Solution Approach 2:
Different base graphs are designed with locally optimized properties tailored to specific information block length ranges. Each base graph has structural characteristics (such as column weights, row weights, and connectivity patterns) that are locally optimized for its target range, ensuring peak performance for that specific segment rather than compromise performance across all ranges.
2Productivity
If multiple LDPC base graphs are maintained for different information block length ranges, then encoding performance and hardware utilization are improved, but device complexity increases
Solution Approach 1:
The system dynamically selects the appropriate base graph based on the information block length of the incoming data. A selection mechanism determines which base graph to use in real-time, allowing the encoder to adapt its structure to match the current processing requirements, thereby optimizing throughput without permanently maintaining all possible graph configurations simultaneously.
Solution Approach 2:
The patent designs base graphs that can serve multiple functions across overlapping information block length ranges. By creating universality in the sense that base graphs can handle ranges of lengths rather than single fixed lengths, the system reduces the total number of graphs needed while still achieving optimized performance across the full spectrum of possible input sizes.
3Productivity
If LDPC codes are optimized for specific information block lengths, then encoding efficiency is improved, but adaptability to varying block lengths deteriorates
Solution Approach 1:
The patent introduces an additional dimension of organization by grouping base graphs according to information block length ranges rather than individual lengths. This dimensional shift allows the system to maintain optimized graphs for specific ranges while providing adaptability across the full spectrum of lengths by selecting the appropriate range-based graph, thus achieving both efficiency and versatility.
Data Source
AI summary
Aspects of the present disclosure relate to low density parity check (LDPC) coding utilizing LDPC base graphs. Two or more LDPC base graphs may be maintained that are associated with different ranges of overlapping information block lengths. A particular LDPC base graph may be selected for an information block based on the information block length of the information block. Additional metrics that may be considered when selecting the LDPC base graph may include the code rate utilized to encode the information block and/or the lift size applied to each LDPC base graph to produce the information block length of the information block.