Polar Code Parity Bit Selection Through PC-Chain Weak-Bit Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current polar code decoding methods face challenges in efficiently determining parity bit positions, leading to suboptimal error correction performance due to limitations in interconnection analysis within and between parity-check chains.
Innovation Solution
A method and apparatus for encoding and decoding polar codes that identify weak-bits or second weak-bits as parity bits based on state-indicator information, optimizing parity bit selection through complex interconnection analysis within and between parity-check chains to enhance decoding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If current polar code decoding methods are used, then the decoding process can be completed, but the error correction performance is suboptimal due to limitations in interconnection analysis within and between parity-check chains
Solution Approach 1:
The patent segments the parity-check matrix into multiple parity-check chains (H1, H2, ..., Hl), where each chain operates semi-independently. This segmentation allows the decoder to analyze interconnections within each chain separately while still capturing cross-chain dependencies through the overall graph structure, thereby improving error correction performance without overwhelming complexity
Solution Approach 2:
The patent introduces a graph-based representation that adds a dimensional perspective to the decoding process. By representing parity-check chains and their interconnections as a graph structure with nodes and edges, the decoder can visualize and process relationships between bits across different chains more effectively, leading to better weak-bit identification
2Measurement precision
If complex interconnection analysis is performed within and between parity-check chains, then parity bit positions can be accurately determined, but the decoding complexity increases
Solution Approach 1:
The patent performs preliminary analysis to identify weak-bits and potential parity bit positions before the main decoding process. By pre-identifying bits that are likely to be parity bits based on their connection patterns in the graph representation, the decoder reduces the computational burden during actual decoding while maintaining high accuracy in parity bit position determination
Solution Approach 2:
The graph-based representation allows the decoding system to self-identify parity bit positions by analyzing the inherent structure and interconnection patterns. The weak-bit identification process automatically reveals which positions are most likely to be parity bits based on their connectivity to other chains, eliminating the need for external guidance or complex iterative optimization
3Reliability
If weak-bits are identified based on state-indicator information and interconnection analysis, then decoding performance is improved, but the processing time and computational resources increase
Solution Approach 1:
The patent applies different analysis depths and state-indicator calculations to different portions of the code based on local characteristics. Bits that show stronger indicators of being weak-bits (based on their connection patterns and state indicators) receive more thorough analysis, while other bits are processed more quickly. This localized approach improves overall decoding performance without uniformly increasing processing time for all bits
Data Source
AI summary
The disclosure relates to a fifth generation (5G) or sixth generation (6G) communication system for supporting a higher data transmission rate. An encoding apparatus may obtain state-indicator information indicating a state of each of bits included in the polar code based on an index set of the bits, identify a weak-bit or a second weak-bit corresponding to a parity bit candidate position preset according to an interconnection within a parity-check (PC)-chain of the polar code and between PC-chains of the polar code as a parity bit, based on a number of weak-bits determined according to the state-indicator information and a number of bits to be used as parity bits, and obtain a polar code including the identified parity bit.