Polar Code Reconstruction for Faster Belief Propagation Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current polar codes with belief propagation decoders face challenges in achieving high error correction performance with low decoding delay times, as the decoding delay increases with the number of iterations required for sufficient error correction.
Innovation Solution
The method involves analyzing decoding importance between individual nodes within a polarization kernel during the initial iterations of the belief propagation decoder, and reconstructing the polar codes based on this analysis. This includes removing bits with low importance and allocating the resulting degree of freedom to bits with higher importance, thereby improving the initial reliability and reducing decoding delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the number of belief propagation iterations is increased to improve error correction performance, then reliability is improved, but decoding delay time increases
Solution Approach 1:
The patent changes the structural parameters of the polar code by reordering bits based on their decoding importance analysis. By analyzing the contribution of each bit to the decoding process and repositioning high-importance bits to positions that maximize their impact in early iterations, the system achieves better error correction performance with fewer iterations, thus reducing decoding delay while maintaining reliability
Solution Approach 2:
The patent performs preliminary analysis of decoding importance for each bit position before code construction. By pre-identifying which bits contribute most to decoding success and arranging them strategically in the code structure, the system prepares the code to converge faster during actual decoding, reducing the number of iterations needed while maintaining high reliability
2Reliability
If polar codes are designed for high reliability with sufficient iterations, then error correction performance is improved, but the decoding delay time increases proportionally
Solution Approach 1:
The patent modifies the polar code structure by reordering bits according to their decoded importance metrics. This parameter change in code construction enables the decoder to achieve convergence in fewer iterations, thereby improving both reliability and decoding speed simultaneously rather than requiring a trade-off between them
3Ease of manufacture
If successive cancellation decoding is used for polar codes, then implementation is straightforward, but decoding delay time is long due to sequential processing
Solution Approach 1:
The patent changes the bit ordering parameters in polar codes optimized for belief propagation decoding. This enables the code to converge rapidly in parallel belief propagation decoding, achieving low latency while maintaining the ability to be decoded with relatively simple algorithms, thus bridging the gap between sequential SC and parallel BP decoding performance
Data Source
AI summary
Disclosed is a method for constructing a fast converging polar code based on a belief propagation decoder. The method includes analyzing decoding importance for each individual bit of an initial belief propagation decoder, and reconstructing the polar code depending on an analyzing result.