Polar Code Bit Distribution with Rate-Weighted Reliability Ranking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing polar code construction methods are inefficient computationally and may introduce undesirable features, such as inadequate minimum code distance in short or medium-length polar codes, which affects their reliability and performance.
Innovation Solution
The method involves determining the reliability of each bit position in a polar code by calculating weighted summations based on a binary expansion, using an enhanced Polarization Weighting (PW) approach that generalizes the β-expansion to improve accuracy and computational efficiency, and strategically selects the expansion factor based on the coding rate and block size to allocate information bits effectively.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing polar code construction algorithms are used, then the code can be constructed, but the computational efficiency is poor and the minimum code distance is insufficient
Solution Approach 1:
The patent changes the parameters of the polarization weighting process by introducing an enhanced weighting function that considers both the binary expansion weights and the position indices of bits. This modifies the reliability estimation parameters to achieve better minimum code distance while maintaining computational efficiency through the structured weighting approach.
Solution Approach 2:
The patent segments the polar code construction process into distinct phases: calculating binary expansion weights for each bit position, determining position-based weights, combining these weights to calculate reliability scores, and finally selecting information bit positions based on sorted reliability values. This segmentation improves both computational efficiency and code performance.
2Measurement precision
If traditional bit allocation methods are used, then the construction process is simple, but the accuracy of information bit allocation is insufficient
Solution Approach 1:
The patent introduces an intermediary reliability calculation mechanism that uses binary expansion weights and position weights as intermediate steps to determine the final reliability scores of bit positions. This intermediary process improves allocation accuracy by providing a more nuanced reliability assessment before final bit position selection.
Solution Approach 2:
The patent performs preliminary calculations of binary expansion weights and position weights for all bit positions before the actual information bit allocation. This preliminary action ensures that when information bits are assigned, the most accurate reliability information is already available, improving allocation precision without adding complexity to the final selection step.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Methods and devices are described for determining reliabilities of bit positions in a bit sequence for information bit allocation using polar codes. The reliabilities are calculated using a weighted summation over a binary expansion of each bit position, wherein the summation is weighted by an exponential factor that is selected based at least in part on the coding rate of the polar code. Information bits and frozen bits are allocated to the bit positions based on the determined reliabilities, and data is polar encoded as the information bits. The polar encoded data is then transmitted to a remote device.