Parallel Polar Coding with Cross-Segment Parity for Low-Latency Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Longer polar codes provide better block error rate (BLER) performance but are limited by increased decoding latency, constraining the maximum code length due to practical implementation requirements.
Innovation Solution
The method involves dividing information bits into multiple segments and encoding them in parallel using shorter chained polar codes, with parity bits cross-concatenated between segments transmitted over different sub-channels to enhance error detection and reduce latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If longer polar codes are used, then block error rate performance is improved, but decoding latency increases
Solution Approach 1:
The patent divides the information bits into multiple segments and encodes each segment separately using shorter polar codes. This segmentation allows parallel decoding of multiple segments, significantly reducing overall decoding latency while maintaining comparable block error rate performance to longer polar codes through the use of cross-concatenated parity bits that provide error detection across segments.
2Loss of time
If shorter chained polar codes are used in parallel, then decoding latency is reduced, but error detection capability may be compromised
Solution Approach 1:
The patent merges the error detection capabilities across multiple segmented polar codes by cross-concatenating parity bits. The parity bits from different segments are combined and transmitted together, allowing the receiver to perform joint error detection on all segments. This merging approach maintains strong error detection capability despite using shorter individual code segments that enable parallel processing and reduced latency.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
Embodiments of this disclosure enhance the error detection performance of parallel polar encoding by cross-concatenating parity bits between segments of information bits transmitted over different sets of sub-channels. In one embodiment, a first segment of information bits is transmitted over a first set of sub-channels, and at least a second segment of information bits, and a masked parity bit, are transmitted over a second set of sub-channels. A value of the masked parity bit is equal to a bitwise combination of a first parity bit computed from the first segment of information bits and a second parity bit computed from the second segment of information bits. The bitwise combination may be a bitwise AND, a bitwise OR, or a bitwise XOR of the respective parity bits.