Polar Code Group Interleaving for Variable Code Lengths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Polar codes with fixed code lengths are not adaptable to varying communication requirements, as their original code length is an integral power of 2, necessitating rate matching to adjust code lengths in practical applications.
Innovation Solution
A method and apparatus for rate matching in polar codes, involving the division of encoded bit sequences into equal-length groups, determining bit positions for puncturing or shortening, and obtaining a new encoded bit sequence by removing specific bits, allowing for any desired code length implementation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If polar codes use fixed code lengths (integral power of 2), then encoding and decoding complexity is reduced, but adaptability to varying communication requirements deteriorates
Solution Approach 1:
The encoded bit sequence is divided into g equal-length groups, where each group contains N/g bits. This segmentation allows selective puncturing or shortening of specific groups to achieve different code lengths while maintaining the underlying polar code structure with fixed mother code length N (integral power of 2), thus preserving low encoding/decoding complexity while improving adaptability.
Solution Approach 2:
The patent introduces dynamic rate matching by allowing the code length to be adjusted from the fixed mother code length N to any desired length M through selective puncturing or shortening of grouped bits. This dynamic adjustment mechanism enables the system to adapt to varying communication requirements while maintaining the simplicity of fixed-length polar code encoding and decoding.
2Adaptability or versatility
If rate matching is applied to adjust code lengths, then adaptability to communication requirements is improved, but device complexity increases
Solution Approach 1:
By dividing the encoded sequence into g equal-length groups, the rate matching process becomes systematic and manageable. The grouping structure simplifies the selection of bits for puncturing or shortening, as entire groups can be selected or discarded based on the desired code length, reducing the complexity compared to selecting individual bits arbitrarily.
Solution Approach 2:
The patent changes the parameter of code length from fixed (integral power of 2) to variable by introducing a rate matching step. Through parameter changes in the form of grouping factor g and selecting different numbers of groups to keep or puncture, the system achieves flexible code length adjustment without fundamentally changing the polar code structure, thereby limiting the increase in complexity.
3Adaptability or versatility
If bits are punctured or shortened to achieve any code length, then code length flexibility is improved, but manufacturing precision of bit positioning deteriorates
Solution Approach 1:
The encoded bit sequence is divided into g equal-length groups, providing a systematic framework for bit position management. This segmentation ensures that when puncturing or shortening occurs, it happens in a structured manner (entire groups or systematic portions), maintaining precision in bit positioning and avoiding arbitrary deletions that would compromise position accuracy.
Solution Approach 2:
The patent applies different treatments to different groups of bits based on their positions and reliability characteristics. By allowing selective puncturing or shortening of specific groups while preserving others, the system maintains high precision in bit positioning for the retained bits, ensuring that important information bits are preserved while less critical bits can be removed.
Data Source
AI summary
Embodiments of this application provide a method for processing information bits in a wireless communication network. A device obtains a Polar encoded bit sequence, then divide the Polar encoded bit sequence into g groups that are of equal length N/g, wherein g is 32. The device block interleaves the g groups to obtain an interleaved bit sequence according to a sequence S, wherein the sequence S comprises: group numbers of the g groups, wherein a group whose number is 0 is the first element in the sequence S, wherein a group whose number is 12 is the 17th element in the sequence S, wherein a group whose number is 31 is the 32nd element in the sequence S, wherein the S is an integer and output the interleaved bit sequence.