Polar Encoding Relaxation by Bit Reliability for Lower Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current polar coding techniques face challenges in reducing encoding and decoding complexity, particularly for medium to large block lengths, which limits their adaptation for high throughput regimes such as 5G NR eMBB data rates, and require significant computational resources and memory for relaxation operations.
Innovation Solution
The proposed solution involves a relaxation scheme that selects encoding nodes based on bit index reliability, grouping them into relaxation groups, and omitting XOR operations between nodes with specific relaxation attributes, thereby reducing computational complexity and memory requirements while maintaining error correction performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If relaxation operations are performed on all encoding nodes to reduce complexity, then encoding and decoding complexity is reduced, but error correction performance deteriorates
Solution Approach 1:
The patent applies different relaxation attributes to different encoding nodes based on their bit index reliability. Encoding nodes associated with reliable bit indexes receive a first relaxation attribute (higher relaxation), while those associated with unreliable bit indexes receive a second relaxation attribute (lower or no relaxation). This local differentiation maintains error correction performance for critical bits while reducing overall complexity.
Solution Approach 2:
The patent changes the relaxation parameter dynamically based on the reliability of each bit index. By selecting relaxation attributes from multiple levels and applying them selectively to different encoding nodes, the system optimizes the balance between complexity reduction and performance maintenance through parameter adaptation.
2Loss of time
If more encoding nodes are processed with full relaxation to reduce latency, then encoding and decoding latency is reduced, but computational accuracy deteriorates
Solution Approach 1:
The patent applies differentiated relaxation attributes to encoding nodes based on bit index reliability, allowing critical nodes to maintain full computational accuracy while less critical nodes undergo greater relaxation. This selective approach reduces overall latency without compromising the accuracy needed for reliable bit positions.
3Quantity of substance
If relaxation is applied to all bit indexes to reduce memory requirements, then memory usage is reduced, but code construction flexibility deteriorates
Solution Approach 1:
The patent implements selective relaxation where different relaxation attributes are assigned to different encoding nodes based on their bit index reliability. This allows the system to reduce memory requirements through relaxation while maintaining code construction flexibility for nodes that require it, achieving a local optimization balance.
Data Source
AI summary
Systems, methods, and instrumentalities are described herein that may be used for reduced complexity polar encoding and decoding. There may be a set of encoding nodes to be used for polar encoding. An encoding node may be associated with a bit index and/or a relaxation level. A relaxation attribute may be selected for the encoding node. A relaxation group may be determined based on the relaxation attributes. The relaxation group may include two encoding nodes associated with consecutive bit indexes, an initial relaxation level, and the first relaxation attribute. A final relaxation level may be determined. Relaxation may be performed on the encoding nodes in the relaxation group. For example, an XOR operation between the encoding nodes may be omitted. Relaxation may be performed on the encoding nodes associated with each relaxation level up to the final relaxation level.