Polar Code Rate-Matching With Adaptive Power-of-2 Buffer Sizing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current rate-matching schemes for control channels using polar codes in wireless communication systems, such as those in 5G networks, face performance losses when the size of the circular buffer is not a power of 2, leading to inefficiencies in bandwidth utilization and data transmission.
Innovation Solution
An efficient rate-matching scheme is proposed that determines the size of a circular buffer based on the minimum supported code rate and the number of information bits, and performs rate-matching by puncturing or repeating bits in a circular buffer of size N2 or N2/2, where N2 is the minimum power of 2 not less than the number of information bits, to match the number of coded bits for transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a fixed circular buffer size is used for rate-matching, then the device complexity is reduced, but the bandwidth utilization efficiency deteriorates when the buffer size is not a power of 2
Solution Approach 1:
The patent applies dynamics by making the circular buffer size adaptive rather than fixed. The buffer size is dynamically determined based on the code rate and the number of information bits to be transmitted. Specifically, the buffer size is set to N2 (the minimum power of 2 not less than K/Rmin) or N2/2, allowing the system to adapt to different transmission requirements while maintaining power-of-2 sizing for efficiency.
Solution Approach 2:
The patent changes the parameter of circular buffer size from a fixed value to a variable determined by system requirements. By calculating the buffer size as N2 or N2/2 based on the code rate and information bit count, the system optimizes bandwidth utilization for different transmission scenarios while maintaining the computational benefits of power-of-2 sizing.
2Productivity
If the circular buffer size is adjusted to match transmission requirements, then the bandwidth utilization efficiency is improved, but the device complexity increases
Solution Approach 1:
The patent changes the parameter of circular buffer size from a fixed value to a variable determined by system requirements. By calculating the buffer size as N2 or N2/2 based on the code rate and information bit count, the system optimizes bandwidth utilization for different transmission scenarios while maintaining the computational benefits of power-of-2 sizing.
Solution Approach 2:
The patent segments the rate-matching process into distinct steps: determining N2 based on K and Rmin, selecting the buffer size as N2 or N2/2, and then performing rate-matching operations. This segmentation simplifies the overall complexity by breaking down the adaptive process into manageable, standardized operations.
3Adaptability or versatility
If rate-matching is performed with non-power-of-2 buffer sizes, then the adaptability to different code rates is improved, but the performance loss increases
Solution Approach 1:
The patent changes the parameter of circular buffer size from a fixed value to a variable determined by system requirements. By calculating the buffer size as N2 or N2/2 based on the code rate and information bit count, the system optimizes bandwidth utilization for different transmission scenarios while maintaining the computational benefits of power-of-2 sizing.
Data Source
AI summary
Certain aspects of the present disclosure generally relate to wireless communications and, more particularly, to methods and apparatus for rate-matching control channels using polar codes. An exemplary method generally includes encoding a stream of bits using a polar code, determining a size of a circular buffer for storing the encoded stream of bits based, at least in part, on a minimum supported code rate and a control information size, and performing rate-matching on stored encoded stream of bits based, at least in part, on a mother code size, N, and a number of coded bits for transmission, E.