Polar Code Rate Matching for List-SC Decoding Reliability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing demand for high-density communication in wireless networks necessitates efficient methods for using limited radio resources to transmit/receive data and control information, and there is a need for improved error correction performance in polar codes, particularly in list-SC decoding.
Innovation Solution
A method and device for encoding and decoding information blocks using polar codes with predetermined puncturing and extension patterns to optimize resource utilization and error correction, including rate matching based on allocated radio resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If polar codes are designed based on SC decoding to select reliable bit channels for information bits, then channel capacity is achieved, but error correction performance in list-SC decoding is degraded
Solution Approach 1:
The patent changes the design parameters of polar codes by introducing a new bit channel selection criterion specifically optimized for list-SC decoding. Instead of using the traditional SC decoding reliability metric, the patent employs a modified selection approach that accounts for the list decoding structure, thereby improving error correction performance without excessive complexity increase
Solution Approach 2:
The patent performs preliminary bit channel selection and ordering before the actual list-SC decoding process. By pre-determining the optimal bit channel configuration based on the specific list-SC decoding structure, the patent prepares the code to maximize error correction performance during the decoding operation without adding runtime complexity
2Productivity
If the number of UEs to which a BS provides services is increased, then communication capacity is improved, but the amount of resources available per UE is reduced
Solution Approach 1:
The patent changes the resource allocation parameters by implementing dynamic rate matching that adapts to the number of served UEs. The system adjusts coding rates, resource block assignments, and modulation schemes based on the current load, allowing the BS to serve more UEs while maintaining adequate resource allocation per user through efficient parameter optimization
Solution Approach 2:
The patent introduces dynamic resource allocation mechanisms where resource parameters are not fixed but adapt in real-time based on the number of active UEs and channel conditions. This dynamic approach allows the system to efficiently share limited radio resources among a larger number of UEs by adjusting allocation proportions according to current system state
3Reliability
If list-SC decoding is used to achieve high error correction performance at finite lengths, then reliability is improved, but the performance degradation compared to SC decoding occurs
Solution Approach 1:
The patent optimizes the list size parameter and bit channel selection criteria specifically for list-SC decoding to maximize error correction performance. By carefully tuning these parameters, the patent achieves near-optimal reliability while controlling the computational overhead compared to pure SC decoding
Solution Approach 2:
The patent performs preliminary bit channel ordering and list initialization before the decoding process to optimize the decoding trajectory. This pre-computation enables the list-SC decoder to achieve high error correction performance with reduced computational complexity during the actual decoding operation
Data Source
Figure 1
Figure 2~3
Figure 4
AI summary
A communication device that encodes an information block for transmission is provided. The communication device: encodes the information block having a size of K on the basis of a polar code having a size of N to determine a bit sequence having a size of N; selects k bit positions among N bit positions in the bit sequence on the basis of a predetermined puncturing pattern; selects, on the basis of a predetermined extension pattern, k intermediate bit values among intermediate bit values generated while encoding the information block on the basis of the polar code having the size of N; and replaces the bit values of the k bit positions in the bit sequence with the k intermediate bit values to generate a codeword having a size of N.