Segmented Polar Encoding for Long Block Rate Matching
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 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 before encoding. Each subsegment is independently encoded using polar encoding to generate code blocks. These code blocks are then concatenated to form the final encoded bit sequence with the target code length. This segmentation approach avoids the need for repetition-based rate matching while achieving flexible code length adaptation, thereby reducing decoding complexity and hardware implementation area.
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, encodes each subsegment independently using polar encoding, and concatenates the resulting code blocks. This segmentation enables the system to achieve any target code length by adjusting the number and size of subsegments without using repetition-based rate matching. The independent encoding of each subsegment maintains optimal encoding performance while achieving flexible code length adaptation.
3Reliability
If segmentation encoding is performed on information bit sequence, then performance loss is reduced and encoding efficiency is improved, 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. This segmentation improves encoding performance by avoiding the performance loss associated with repetition-based rate matching. The encoding process complexity is managed through systematic segmentation and independent encoding of each subsegment, which can be efficiently implemented using existing polar encoding hardware.
Solution Approach 2:
The patent combines multiple independently encoded code blocks by concatenation to form the final encoded bit sequence. This merging process is simple and efficient, requiring only sequential concatenation of the code blocks. The combining operation maintains the benefits of segmentation while avoiding complex integration requirements, thus improving encoding performance without significantly increasing overall process 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, M>1024. 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.