Polar Code Bit-Channel Partitioning for Efficient Bit Location Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional techniques for describing bit-channels in polar codes are inefficient, requiring a large number of bits to determine the locations of information bits, which hampers the encoding and decoding processes in wireless communication systems.
Innovation Solution
The proposed method employs recursive partitioning of bit-channels and binary partition assignment vectors to efficiently determine the bit locations of information bits in polar codes, reducing the number of bits required to describe these locations compared to conventional methods.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If conventional techniques are used to describe bit-channels in polar codes, then the locations of information bits can be determined, but a large number of bits are required to describe these locations, reducing efficiency
Solution Approach 1:
The patent applies segmentation by dividing the bit-channel description into multiple stages of polarization. Instead of describing all bit locations in a single comprehensive sequence, the method segments the description into hierarchical levels where each stage describes a subset of bit-channels. This segmentation reduces the total number of bits required by only describing the necessary portions at each level, thereby improving efficiency while maintaining complete information about bit locations.
2Reliability
If conventional bit-channel description methods are used, then complete information about bit locations is provided, but the complexity of the encoding and decoding processes increases
Solution Approach 1:
The patent implements the nested doll principle through hierarchical nesting of polarization stages. Each stage of polarization is nested within the overall polar code structure, with inner stages providing detailed information about specific bit-channel subsets while outer stages provide the broader framework. This nested structure allows the system to maintain complete bit location information through multiple layers of description, while the hierarchical organization reduces processing complexity by breaking down the overall task into manageable nested components.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Methods, systems, and devices that support an efficient sequence-based polar code description are described. In some cases, a wireless device (e.g., a user equipment (UE) or a base station) may transmit a codeword including a set of information bits encoded using a polar code or receive a codeword including a set of information bits encoded using a polar code. As described herein, the wireless device may determine the bit locations of the information bits in the polar code based on a partition assignment vector. Specifically, the wireless device may partition bit-channels for one or more stages of polarization and assign information bits to partitions based on the partition assignment vector. Once the bit locations of the information bits are determined, the wireless device may decode a received codeword or transmit an encoded codeword based on the determined bit locations of the information bits.