Sequence-Based Polar Code Mapping with Recursive Bit-Channel Partitioning
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 information bit locations, which hampers the encoding and decoding processes in wireless communication systems.
Innovation Solution
The proposed method employs recursive partitioning of bit-channels for multiple stages of polarization and uses binary partition assignment vectors to efficiently determine and assign information bits to partitions, reducing the number of bits required to describe bit locations by using a fixed sequence based on reliability metrics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional techniques are used to describe bit-channels in polar codes, then complete information bit location determination is achieved, but the number of bits required is large, reducing encoding and decoding 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 large set, the method segments the description into hierarchical levels where each stage describes a subset of bit-channels. This segmentation reduces the number of bits required at each stage while maintaining complete location determination capability across all stages.
Solution Approach 2:
The patent introduces a new dimensional approach by using binary partition assignment vectors that operate in a hierarchical staging dimension. Rather than using a flat one-dimensional bit sequence to describe all bit locations, the method adds a staging dimension where each stage operates on a subset of bit-channels, effectively transforming the problem from a single large description to multiple smaller staged descriptions.
2Productivity
If the number of bits used to describe bit locations is reduced, then encoding and decoding efficiency improves, but the complexity of determining information bit locations increases
Solution Approach 1:
The patent applies preliminary action by pre-defining the staging structure and binary partition assignment vectors before the actual encoding or decoding process. The hierarchical stages and partitioning schemes are established in advance, allowing the reduced-bit description method to work systematically without requiring complex real-time computations during encoding or decoding operations.
Solution Approach 2:
The patent introduces binary partition assignment vectors as intermediary structures that mediate between the reduced bit descriptions and the actual bit-channel locations. These vectors serve as intermediate representations that capture the essential location information in a compressed form, enabling efficient translation from compact descriptions to full bit-location determination without requiring direct complex calculations.
Data Source
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.