LDPC Decoding With Selective Variable-Node Update Skipping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity of low-density parity check (LDPC) decoding in wireless communication systems is high, leading to reduced throughput, which is a critical issue in 5G and future cellular systems.
Innovation Solution
The proposed method involves selectively skipping updates for certain variable nodes (VNs) during LDPC decoding by identifying sets of VNs with high log-likelihood ratios (LLRs) and initializing specific VNs, such as shortening and single parity check (SPC) VNs, to reduce the number of iterations and improve throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If standard LDPC decoding is performed with full message updates for all variable nodes, then decoding reliability is maintained, but decoding complexity is high and throughput is reduced
Solution Approach 1:
The patent extracts and identifies a specific subset of variable nodes (those with LLR magnitude exceeding a threshold) that require message updates, separating them from the full set of variable nodes. This extraction allows the decoder to process only the necessary subset, reducing computational complexity while maintaining decoding reliability for the most critical nodes.
Solution Approach 2:
The patent applies partial action by performing message updates only for a portion of variable nodes (those with high LLR magnitude) rather than all variable nodes. This partial updating strategy reduces the number of operations per iteration, thereby increasing throughput while still ensuring reliable decoding for the most uncertain bits that require attention.
2Productivity
If message updates are skipped for variable nodes with high LLR magnitude, then decoding complexity is reduced and throughput is improved, but decoding precision may be compromised
Solution Approach 1:
The patent applies local quality by differentiating the treatment of variable nodes based on their individual LLR magnitudes. Variable nodes with high LLR magnitude (indicating high confidence) are excluded from updates, while those with lower LLR magnitude (indicating uncertainty) continue to receive full processing. This localized differentiation optimizes resources while maintaining precision where needed.
Solution Approach 2:
The patent changes the parameter of message update application by introducing a threshold-based selection criterion. Instead of uniformly updating all variable nodes, the system dynamically determines which nodes require updates based on their LLR magnitude parameter, thereby adapting the decoding process to the actual reliability of each node's current estimate.
3Productivity
If the number of LDPC decoding iterations is reduced, then throughput is improved, but error rate performance deteriorates
Solution Approach 1:
The patent performs preliminary action by pre-identifying variable nodes with high LLR magnitude before the decoding iterations begin. This preliminary identification allows the system to establish a reduced set of variable nodes that will receive message updates throughout the decoding process, enabling fewer iterations to achieve convergence while maintaining reliability for the critical nodes.
Data Source
AI summary
Decoding low-density parity check (LDPC) codes in a communication system includes identifying a first set of indices of variable nodes (VNs) having log-likelihood ratios (LLRs) greater than a threshold. A second set of indices that includes the first set of indices, indices of shortening VNs, and indices of single parity check (SPC) VNs is created. LDPC decoding proceeds by iteratively updating check-to-variable (C2V) messages and variable-to-check (V2C) messages, with updates for a VN being skipped when an index of the respective VN belongs to the second set of indices.