Polar Code Segmentation for Repetition-Limited Rate Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Repetition-based rate matching in polar codes leads to performance loss in communication systems, particularly when the target code length exceeds the mother code length, as it requires repeated sending of encoded bits, increasing decoding complexity and delay.
Innovation Solution
The method involves segmenting the information bit sequence into multiple segments, performing polar encoding on each segment separately, and then rate-matching and interleaving them, allowing for reduced reliance on repetition-based rate matching and maintaining existing interleaver performance.
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 delay increase
Solution Approach 1:
The information bit sequence is divided into multiple segments before polar encoding. Each segment is encoded separately and then rate-matched. This segmentation allows the system to achieve target code lengths without excessive repetition, thereby reducing decoding complexity while maintaining code length flexibility.
Solution Approach 2:
The information bit sequence is pre-processed by segmentation and rate-matching before polar encoding. By performing these operations in advance, the system avoids the need for complex post-decoding repetition operations, reducing overall decoding complexity and delay.
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 decoding delay increases
Solution Approach 1:
By segmenting the information bit sequence into multiple parts that can be encoded and rate-matched independently, the system reduces the amount of repetition needed after decoding, thereby reducing decoding delay while maintaining the ability to achieve various target code lengths.
Solution Approach 2:
Rate-matching operations are performed preliminarily on each segment before polar encoding. This preliminary rate-matching reduces the need for extensive repetition operations during or after decoding, thereby reducing decoding delay while maintaining code length adaptability.
3Reliability
If information bit sequence is segmented and separately encoded, then reliance on repetition-based rate matching is reduced, but encoding process complexity increases
Solution Approach 1:
The information bit sequence is divided into multiple segments that are encoded separately. This segmentation reduces the performance loss associated with repetition-based rate matching while the modular nature of segment-based encoding keeps the encoding process complexity manageable through reuse of existing polar encoding components.
Data Source
AI summary
Embodiments of this application provide a method for encoding data in a wireless communication network. A communication device obtains an information bit sequence of a bit length K and a code length M. When M is greater than or equal to a first threshold and K is greater than or equal to a second threshold, the device divides the information bit sequence into p subsequences that are of an equal length K1. Then the device encodes each of the p subsequence to obtain p encoded subsequences. The device rate-matches each of the p encoded subsequences to obtain p rate matched subsequences, concatenates the p rate matched subsequences to obtain the output sequence of the code length M, then outputs the output sequence.