LDPC Lifting Size Mapping to Reduce QSN Shift-Value Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing LDPC code encoding methods require storing a large number of shifting values, leading to a complex LDPC cyclic shift network (QSN) due to each group of lifting sizes corresponding to one group of shifting values.
Innovation Solution
The method reduces the number of shifting values needed by determining a target lifting size and a corresponding shifting value set based on the length of information bits and the LDPC base graph, allowing for a more efficient storage and processing of LDPC codes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If each group of lifting sizes corresponds to one group of shifting values, then the LDPC code can be encoded with good performance, but the quantity of shifting values that need to be stored becomes large and the QSN becomes complex
Solution Approach 1:
The patent combines multiple lifting size groups into a single lifting size group, and correspondingly combines multiple shifting value groups into a single shifting value group. This merging approach reduces the number of separate storage units from n groups to m groups (where m < n), directly reducing the quantity of shifting values that need to be stored while maintaining the LDPC code encoding performance through the combined set of lifting sizes and shifting values.
Solution Approach 2:
The patent creates a universal shifting value group that serves multiple lifting size groups simultaneously. Instead of having dedicated shifting values for each lifting size group, a single combined shifting value group is designed to work with the combined lifting size group, making the system more versatile and reducing the overall storage requirement while maintaining functionality across different lifting size configurations.
2Adaptability or versatility
If n groups of shifting values are stored to support n bases, then complete LDPC code functionality is maintained, but the storage requirement becomes large
Solution Approach 1:
The patent merges n separate shifting value groups into a single combined shifting value group containing m elements (where m < n). This combined group is constructed to provide the necessary shifting values for multiple lifting size groups simultaneously, reducing the total storage requirement from n groups to m elements while maintaining the ability to support diverse LDPC code configurations through the unified structure.
Data Source
AI summary
This application provides a data transmission method and an apparatus. A first device determines a target lifting size based on a length of an information bit corresponding to to-be-transmitted data and an information column quantity of an LDPC base graph, where the target lifting size is in at least one of m lifting size sets, one lifting size set includes a lifting size corresponding to at least one of n bases, the m lifting size sets include lifting sizes corresponding to the n bases, a lifting size corresponding to an ith base ai in the n bases is determined based on a product of ai and an integer power of 2, n is greater than m, and ai is a positive integer. The first device determines, from m shifting value sets, a first shifting value set corresponding to the target lifting size.