Polar Code Puncturing with Preallocated Bit Channels
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional polar code puncturing methods require resource-intensive channel re-estimation procedures, leading to increased decoding latency and delay in wireless communication systems, especially when dealing with large numbers of punctured bits.
Innovation Solution
A low complexity rate-matching design for polar codes that adjusts information bits allocation based on the number of punctured bits, allowing for full rate-matching granularity without the need for good bit re-estimation after puncturing, with the decoding complexity and delay dependent on the size M1 instead of N=2n, by setting the first N−M1 bit channels to frozen bits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional polar code puncturing methods are used, then code rate matching is achieved, but channel re-estimation procedures increase decoding latency and delay
Solution Approach 1:
The patent applies preliminary action by pre-determining the allocation of information bits to specific bit channels based on the number of punctured bits before encoding occurs. This pre-allocation eliminates the need for channel re-estimation after puncturing, as the bit assignment is already optimized for the punctured code rate. The information bits are assigned to bit channels that will remain after puncturing, ensuring optimal performance without requiring post-puncturing analysis.
2Reliability
If good bit re-estimation is performed after puncturing, then decoding accuracy is improved, but resource consumption and delay increase
Solution Approach 1:
The patent performs the bit allocation optimization in advance, before the puncturing operation. By calculating and assigning information bits to specific bit channel positions based on the expected puncturing pattern, the system ensures decoding accuracy is maintained without requiring resource-intensive re-estimation operations after puncturing occurs.
Solution Approach 2:
The patent creates a mapping relationship between information bits and bit channel positions that is copied from the full-rate code structure to the punctured code structure. This mapping is predetermined based on the puncturing pattern, allowing the receiver to correctly interpret the punctured codeword without performing complex re-estimation, thus maintaining decoding accuracy with reduced computational resources.
3Reliability
If information bits allocation is optimized for punctured codes, then decoding performance is improved, but calculation complexity increases
Solution Approach 1:
The patent segments the bit channels into different groups or regions based on their positions and reliability characteristics. By dividing the bit channel space into segments that correspond to different puncturing patterns, the allocation calculation becomes more manageable and systematic, reducing overall complexity while maintaining optimal decoding performance.
Data Source
AI summary
Features of the present disclosure implement a low complexity rate-matching design for polar codes that supports full rate-matching granularity, in some cases without good bit re-estimation after puncturing. In particular, features of the present disclosure provide techniques for adjusting the information bits allocation based on the number of punctured bits (P) for block puncturing polar codes. Particularly, features of the present disclosure determine the number of information bits for each sector based on a capacity formula after the puncturing.