LDPC Parity Matrix Structure for Unequal Error Protection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel coding methods for GNSS and satellite radio navigation systems lack fine optimization of the trade-off between bit rate and protection level, particularly failing to provide differentiated protection for data of varying priority levels, leading to inefficient error correction and transmission latency.
Innovation Solution
A new parity matrix structure for LDPC codes is introduced, allowing for two distinct levels of protection by separating data into high and low priority bits, enabling independent transmission and decoding of each block, thereby optimizing protection and transmission time based on priority.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If a simple error-correcting code is applied to the entire data frame, then the implementation is simple and the bandwidth consumption is uniform, but the protection level cannot be optimized for different priority levels of data
Solution Approach 1:
The data frame is segmented into multiple groups based on priority levels (e.g., high-priority navigation data, medium-priority ephemeris data, low-priority almanac data). Each group is then encoded with appropriate error correction codes tailored to its specific protection requirements, allowing differentiated protection while maintaining implementation feasibility through modular processing.
2Adaptability or versatility
If differentiated protection is applied to all data, then the protection optimization is achieved, but the processing complexity and signaling overhead increase significantly
Solution Approach 1:
Different error correction code rates and structures are applied locally to different data groups based on their priority levels. High-priority data receives stronger protection with lower code rates, while low-priority data uses higher code rates. This local differentiation achieves protection optimization without requiring complete restructuring of the entire coding system.
Solution Approach 2:
The error correction code parameters (code rate, block length, parity bits) are changed according to data priority levels. By adjusting these parameters dynamically based on the importance of each data group, the system achieves differentiated protection while managing complexity through parameter optimization rather than structural complexity.
3Reliability
If high-priority data is given maximum protection, then the reliability of critical data is improved, but the bandwidth efficiency and transmission time for other data deteriorate
Solution Approach 1:
Optimal code rates are selected for each priority level based on channel conditions and data importance. High-priority data uses lower code rates (e.g., 1/2 or 2/3) for maximum reliability, while medium and low-priority data uses progressively higher code rates (e.g., 3/4 or 7/8) to maintain overall bandwidth efficiency. This parameter optimization ensures critical data reliability without excessive bandwidth consumption.
Solution Approach 2:
Maximum error correction protection is applied only to the extent necessary for each priority level. High-priority data receives stronger protection than lower-priority data, but not excessive protection that would waste bandwidth. The protection level is matched to the actual requirements of each data group, achieving reliability optimization without sacrificing overall transmission efficiency.
4Reliability
If the entire coded frame must be received for decoding, then the error correction is comprehensive, but the latency for high-priority data increases
Solution Approach 1:
The coded frame is segmented into independently decodable blocks corresponding to different priority levels. High-priority data is organized into self-contained code blocks that can be decoded independently without waiting for the entire frame. This segmentation enables partial decoding of critical data while maintaining comprehensive error correction within each block, significantly reducing latency for time-sensitive applications.
Solution Approach 2:
High-priority data blocks are structured to be self-sufficient with all necessary parity and check bits included within each block. This preliminary organization allows the receiver to decode high-priority data as soon as those specific blocks are received, without needing to wait for low-priority data blocks. The error correction capability is built into each segment in advance, enabling immediate decoding when needed.
Data Source
Figure 1~3
Figure 4~5
Figure 6
AI summary
The invention proposes a new method of unequal error protection which is based on a particular parity matrix structure for LDPC type codes.