Polar Code Interleaving With Unified Bit Selection for Large Code Sizes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current polar code interleaving and bit selection methods in wireless communication networks face challenges in efficiently managing large mother code sizes and achieving optimal error correction performance, particularly in next-generation wireless data communication systems.
Innovation Solution
The implementation of middle-part interlaced sub-block interleaving for polar code interleaving and rate-dependent unified bit selection, categorized into repetition, puncturing, and shortening operations, with specific access schemes for each category, to optimize bit sequence transmission and error correction.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If polar code size N is increased to exceed physical code bit size for better error correction, then error correction performance is improved, but transmission efficiency and resource utilization deteriorate
Solution Approach 1:
The polar code is divided into three distinct segments: lower part (first set of bits), middle part (second set of bits), and upper part (third set of bits). Each segment undergoes different interleaving operations tailored to its specific characteristics, allowing optimized handling of each portion while managing the overall large code size efficiently
Solution Approach 2:
Different interleaving strategies are applied to different parts of the polar code: rate-independent interlaced sub-block interleaving for the middle part, and rate-dependent interleaving for the lower and upper parts. This localized optimization ensures each segment receives the most appropriate processing for its error correction needs while maintaining overall transmission efficiency
2Device complexity
If rate-independent interlaced sub-block interleaving is applied to middle part for simplified processing, then device complexity is reduced, but adaptability to different code rates deteriorates
Solution Approach 1:
The system dynamically selects between rate-independent and rate-dependent interleaving approaches based on the specific code rate requirements. The middle part uses a fixed rate-independent approach for simplicity, while the lower and upper parts employ rate-dependent interleving that adapts to different code rates, achieving a balance between complexity and adaptability
Solution Approach 2:
The polar code is segmented into three parts with different interleving strategies: the middle part uses rate-independent interlaced sub-block interleving for simplified processing, while the lower and upper parts use rate-dependent interleving that adapts to different code rates, thus balancing complexity and adaptability
3Ease of operation
If unified bit selection rule is used across all three categories, then ease of operation is improved, but performance optimization for specific rate scenarios deteriorates
Solution Approach 1:
While maintaining a unified bit selection rule framework for ease of operation, the patent applies different selection strategies to different categories: selection from the beginning for repetition, selection from the end for puncturing, and selective shortening for shortening operations. This localized optimization within the unified framework ensures both operational simplicity and performance optimization
Data Source
AI summary
Apparatus and methods are provided for polar code sub-block interleaving and bit selection. In one novel aspect, middle-part interlaced sub-block interleaving is provided for polar code interleaving. In one embodiment, the middle part of the polar code is interlaced and generates the interleaved polar code. In another embodiment, the lower part and the upper part are also sub-block interleaved with the middle-part interlaced method. In another novel, rate-dependent unified bit selection is provided. The bit selection is categorized into three operation categories of repetition, puncturing and the shortening. Each category follows unified bit selection rule with different categories differ only in the access scheme. In one embodiment, the circular buffer is used for bit selection.