Multiple LDPC Base Graphs for Wide-Range Block Length Coding
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 implementation of multiple LDPC base graphs, each associated with different ranges of information block lengths and code rates, allows for the selection of the most suitable graph based on the specific requirements of the information block, such as block length or code rate, to optimize decoding and encoding processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single LDPC base graph is used to support all information block lengths and code rates, then the system complexity is reduced, but the decoder resource utilization and throughput efficiency deteriorate
Solution Approach 1:
The patent divides the single LDPC base graph into multiple base graphs (first LDPC base graph and second LDPC base graph), each optimized for specific information block length ranges. The decoder is segmented into multiple decoding units that can be selectively activated based on the input block length, allowing efficient resource utilization without requiring a single overly complex graph to handle all cases.
Solution Approach 2:
The system dynamically selects which LDPC base graph and corresponding decoding units to use based on the information block length of the incoming data. This dynamic adaptation allows the decoder to optimize its resource allocation and throughput efficiency for each specific coding scenario, rather than being constrained by a fixed single-graph architecture.
2Productivity
If multiple LDPC base graphs are maintained for different information block lengths and code rates, then decoder resource utilization and throughput are improved, but the device complexity increases
Solution Approach 1:
Each LDPC base graph and its associated decoding units are designed to be universally applicable within their designated information block length ranges. The first base graph handles shorter blocks while the second handles longer blocks, creating a universal solution that efficiently covers the entire operational range without requiring separate specialized hardware for each case.
Solution Approach 2:
The system changes operational parameters (which base graph to use, which decoding units to activate) based on the information block length parameter. This parameter-driven selection allows the system to adapt its complexity level to match the requirements of the current task, using more resources only when necessary for longer block lengths.
3Adaptability or versatility
If LDPC codes are designed to support a wide range of information block lengths and code rates, then the adaptability of the system is improved, but the hardware utilization efficiency deteriorates
Solution Approach 1:
Different regions of the system (different base graphs and decoding units) are assigned different qualities or capabilities optimized for their specific operational ranges. The first base graph and its decoding units are optimized for shorter information blocks, while the second base graph and its units are optimized for longer blocks, creating local quality variations that improve overall hardware utilization efficiency.
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.