Polar Code Segmentation for Flexible Lengths Without Repetition Loss
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The repetition-based rate matching scheme in polar codes leads to performance loss in communications systems, particularly when the target code length exceeds the mother code length, as it increases decoding complexity and hardware implementation area without adequately balancing encoding performance and complexity.
Innovation Solution
A method is introduced to reduce the use of repetition-based rate matching by segmenting the information bit sequence into subsegments, performing independent polar encoding on each segment, and combining the results to achieve the target code length, thereby minimizing performance loss and decoding complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If repetition-based rate matching is used to achieve target code length greater than mother code length, then code length flexibility is improved, but decoding complexity and hardware implementation area increase
Solution Approach 1:
The patent segments the information bit sequence into multiple subsegments, performs independent polar encoding on each subsegment to generate sub-encoded sequences, and then combines these sub-encoded sequences through rate matching to achieve the target code length. This segmentation approach avoids the need for repetition-based rate matching on the entire sequence, thereby reducing decoding complexity and hardware implementation area while maintaining code length flexibility.
2Adaptability or versatility
If repetition-based rate matching is used to achieve target code length greater than mother code length, then code length flexibility is improved, but encoding performance deteriorates
Solution Approach 1:
The patent divides the information bit sequence into multiple subsegments and performs independent polar encoding on each subsegment. This segmentation allows each subsegment to be encoded with optimized parameters suitable for its specific characteristics, avoiding the performance degradation that occurs when repetition-based rate matching is applied to the entire sequence. The combined encoded sequence achieves both code length flexibility and maintained encoding performance.
3Reliability
If segmentation encoding is performed on information bit sequence, then probability of using repetition-based rate matching decreases and performance loss is reduced, but encoding process complexity increases
Solution Approach 1:
The patent segments the information bit sequence into multiple subsegments and performs independent polar encoding on each subsegment. While this segmentation does increase the number of encoding operations, it eliminates or reduces the need for repetition-based rate matching, which is computationally more intensive during decoding. The overall system complexity is reduced when considering both encoding and decoding operations together.
Solution Approach 2:
The patent combines multiple sub-encoded sequences through rate matching to form the final encoded sequence with the desired target code length. This merging process integrates the results from multiple independent encoding operations into a unified output, achieving the desired code length without requiring repetition-based rate matching on the entire sequence, thereby maintaining performance while managing complexity.
Data Source
AI summary
Embodiments of this application provide an information processing method and a coding apparatus. An information bit sequence includes a K-bit information block. The information bit sequence is to be processed into an encoded bit sequence with a target code length M. For a given code rate R, when the length K of the information block is greater than a preset threshold, the information bit sequence is segmented into two or more segments. Each segment is polar encoded into an encoded subsequence. The encoded subsequence has a length that equals to a mother code length Ni, and i=1, 2, . . . , p. Each of the p encoded subsequences is rate matched to obtain a rate-matched encoded subsequence. A rate-matched encoded subsequence i of the p rate-matched encoded subsequences has a code length Mi. The p rate-matched encoded subsequences are concatenated into an encoded bit sequence which has a code length M.