Polar Code Rate Matching Using 32-Group Bit Interleaving
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
1Adaptability or versatility
If polar codes use fixed code lengths (integral power of 2), then encoding and decoding complexity is reduced and theoretical performance is achieved, 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 any desired code length while maintaining the underlying polar code structure and its theoretical performance benefits.
Solution Approach 2:
The patent introduces dynamic rate matching by allowing the code length to be adjusted from the fixed integral power of 2 to any desired length through selective bit removal. The system can dynamically choose to puncture or shorten bits based on channel conditions and communication requirements, making the polar code adaptable while keeping the encoding/decoding complexity manageable.
2Adaptability or versatility
If rate matching is applied to adjust code lengths, then adaptability to communication requirements is improved, but implementation complexity increases
Solution Approach 1:
By organizing the encoded bits into g equal-length groups, the patent simplifies the rate matching implementation. Each group can be independently processed for puncturing or shortening, making the implementation systematic and easier to manufacture compared to arbitrary bit selection methods.
Solution Approach 2:
The patent changes the parameter g (number of groups) to control the granularity of rate matching. By adjusting g, the system can balance between code length flexibility and implementation complexity, providing a practical solution that is easier to implement than general rate matching approaches.
3Adaptability or versatility
If bits are removed for rate matching, then any code length can be achieved, but data transmission reliability may deteriorate
Solution Approach 1:
The patent applies different quality treatment to different groups of bits. By selectively puncturing or shortening specific groups while preserving others, the system maintains high reliability in preserved bits while achieving desired code lengths. The grouping allows local optimization where important bits are protected and less critical bits are removed.
Solution Approach 2:
The system dynamically selects which groups to puncture or shorten based on channel conditions and reliability requirements. This dynamic approach allows the system to maintain data transmission reliability by adapting the rate matching strategy to current communication conditions, rather than using fixed removal patterns.
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.