LDPC Base Graph Allocation Across Block Length and Code Rate
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 a different range of information block lengths, allowing for selection based on the information block length, code rate, and lift size to optimize decoding and encoding processes, thereby enhancing decoder resource utilization and throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple LDPC base graphs are maintained with overlapping information block length ranges, then decoder resource utilization and throughput are improved, but device complexity increases
Solution Approach 1:
The patent divides the LDPC decoding system into multiple base graphs, each handling specific information block length ranges. This segmentation allows the decoder to select the most appropriate base graph for each codeword, optimizing resource utilization and throughput while managing complexity through structured division of functionality
Solution Approach 2:
The patent creates base graphs with overlapping information block length ranges, enabling each base graph to serve multiple purposes. This multi-functionality allows a single base graph to handle various codeword lengths within its range, improving decoder versatility and resource utilization without requiring completely separate decoders for each length
2Productivity
If multiple LDPC base graphs are maintained with overlapping information block length ranges, then hardware resource utilization is improved, but device complexity increases
Solution Approach 1:
The patent segments the hardware decoding resources into multiple base graphs, each optimized for specific information block length ranges. This segmentation enables more efficient utilization of hardware resources by matching the appropriate base graph to each incoming codeword, preventing resource idle time while avoiding the need for completely separate hardware for each length
Solution Approach 2:
The patent implements dynamic base graph selection based on the information block length of each codeword. This dynamic approach allows the system to adaptively choose the most suitable base graph in real-time, optimizing hardware resource utilization for each decoding operation while maintaining a fixed set of base graphs to control overall device complexity
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.