Polar Code Segmentation for Long Code Length Rate Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Polar codes face performance loss due to the repetition-based rate matching scheme used in communications systems, which affects encoding performance and complexity.
Innovation Solution
A method that involves segmenting the information bit sequence into subsegments when the target code length exceeds the mother code length, allowing for independent polar encoding and rate matching of each subsegment, thereby reducing the reliance on repetition-based rate matching and minimizing performance loss.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If repetition-based rate matching is used to achieve target code length greater than mother code length, then rate matching can be implemented with low decoding complexity, but encoding performance deteriorates due to performance loss
Solution Approach 1:
The patent segments the information bit sequence into multiple subsegments before encoding. Each subsegment is independently encoded using polar encoding to generate code blocks, which are then combined through multiplexing to form the final encoded bit sequence. This segmentation approach avoids the performance loss inherent in repetition-based rate matching while maintaining manageable decoding complexity through independent subsegment processing.
2Adaptability or versatility
If the target code length M is greater than the mother code length N, then rate matching is required to achieve the desired code length, but using repetition causes performance loss
Solution Approach 1:
The patent divides the information bit sequence into multiple subsegments, each of which is independently encoded using polar encoding with mother code length N. The encoded subsegments are then multiplexed to achieve the target code length M. This approach provides flexible code length adaptation without relying on repetition, thereby avoiding performance loss while maintaining adaptability to different target code lengths.
Solution Approach 2:
The patent combines multiple independently encoded subsegments through multiplexing to form the final encoded bit sequence of target length M. This merging process allows flexible adjustment of the target code length by varying the number and size of subsegments, achieving code length adaptability without the performance degradation caused by repetition-based methods.
3Reliability
If information bit sequence is segmented into subsegments for independent polar encoding, then performance loss from repetition is reduced, but encoding process complexity increases
Solution Approach 1:
The patent segments the information bit sequence into multiple subsegments that are independently encoded using polar encoding. This segmentation improves encoding performance by avoiding repetition-based rate matching. The encoding process complexity is managed through systematic subsegment processing and efficient multiplexing of encoded results, where each subsegment can be processed in parallel.
Solution Approach 2:
The patent dynamically adjusts the segmentation parameters (number of subsegments, size of each subsegment) based on the target code length and channel conditions. This dynamic adaptation allows the system to optimize the balance between encoding performance and process complexity for different operating scenarios, rather than using a fixed segmentation scheme.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Embodiments of this application provide a polar coding method and a coding apparatus. The method includes: obtaining a to-be-sent information block and a target code length M of a polar code; determining a mother code length N used for polar encoding, when the target code length M is greater than N, if an encoding parameter of the information block meets a preset condition, segmenting a to-be-encoded information bit sequence into p subsegments, and performing independent polar encoding on the p subsegments, to obtain p encoded bit sequences whose lengths are respectively mother code lengths of the subsegments; separately performing rate matching on p encoding results, to obtain p encoded bit sequences whose lengths are respectively target code lengths of the subsegments; and combining the p rate-matched encoded bit sequences, to obtain an encoded bit sequence whose length is M, where p is an integer greater than or equal to 2. The coding method can reduce use times of a repetition-based rate matching scheme, and reduce a performance loss caused by repetition.