Polar Encoding Segmentation for Long Code Length Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Repetition-based rate matching in polar codes leads to performance loss and increased decoding complexity, particularly when the target code length exceeds the mother code length.
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, which reduces the reliance on repetition-based rate matching and maintains 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 increases and performance loss occurs
Solution Approach 1:
The information bit sequence is divided into multiple segments, and each segment is independently polar encoded. This segmentation approach eliminates the need for repetition-based rate matching by directly generating the required code length through proper segment concatenation, thereby reducing decoding complexity while maintaining code length flexibility
Solution Approach 2:
The patent transitions from time-domain repetition (sending same bits multiple times) to segment-based parallel encoding (encoding different bits in parallel). This dimensional shift from sequential repetition to parallel segment processing achieves the same code length extension without the performance degradation and complexity overhead of repetition
2Adaptability or versatility
If repetition-based rate matching is used to extend code length, then target code length is achieved, but error performance deteriorates
Solution Approach 1:
By segmenting the information bits and independently encoding each segment, the patent ensures that each segment contributes unique information to the final codeword. This eliminates the redundant repetition of same bits that causes performance loss, while still achieving the desired code length through segment concatenation
Solution Approach 2:
The patent changes the encoding parameter from repetition count to segment count. Instead of repeating encoded bits to extend code length, the system adjusts the number of segments and their individual encoding parameters to achieve the target code length, thereby maintaining optimal error performance
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.