Polar Code BP Decoding With Conflict Search List Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Belief Propagation (BP) based decoding for polar codes faces performance limitations compared to Successive Cancellation List (SCL) decoding, particularly in terms of decoding latency and computational complexity, while also experiencing unnecessary increased computing consumption due to excessive iterations for sequences that cannot be decoded.
Innovation Solution
The proposed Belief Propagation Conflict Search List (BPCSL) decoding method involves identifying conflict verification processing elements (VPEs) in the decoding process, updating right-to-left tables to generate potential decoding paths, and performing BP decoding on these paths to enhance decoding performance and reduce latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If BP based decoding is used for polar codes, then decoding complexity is reduced compared to SCL decoding, but decoding performance deteriorates with higher latency and inability to decode certain sequences
Solution Approach 1:
The patent segments the decoding process by identifying conflict VPEs and dividing the right-to-left table into multiple potential tables based on different conflict resolutions. This allows parallel processing of multiple decoding paths while maintaining lower complexity than full SCL decoding, thus resolving the contradiction between complexity and performance.
Solution Approach 2:
The patent introduces dynamic conflict detection and resolution mechanisms that adapt the decoding process based on identified conflicts. By dynamically generating potential right-to-left tables only when conflicts are detected and resolving them through systematic exploration, the system achieves better performance without proportionally increasing complexity.
2Reliability
If BP decoding performs excessive iterations to handle undecodable sequences, then decoding performance may improve, but computing consumption increases unnecessarily
Solution Approach 1:
The patent performs preliminary conflict detection and generates potential right-to-left tables before executing full decoding iterations. By identifying and resolving conflicts in advance, the system avoids unnecessary excessive iterations, thus reducing computing consumption while maintaining the ability to handle previously undecodable sequences.
Solution Approach 2:
The patent implements feedback mechanisms where decoding results are checked against conflicts, and potential right-to-left tables are generated based on detected issues. This feedback loop allows the system to focus computational resources only on resolving actual conflicts rather than performing blanket excessive iterations, reducing energy consumption while improving reliability.
3Ease of manufacture
If traditional BP decoding is used, then implementation is simple, but decoding latency increases and system capacity is limited
Solution Approach 1:
The patent segments the decoding workload by identifying conflict VPEs and generating only the necessary potential right-to-left tables for conflict resolution. This selective approach maintains implementation simplicity while improving decoding efficiency by avoiding unnecessary computations, thus resolving the contradiction between ease of implementation and productivity.
4Measurement precision
If more potential right-to-left tables are generated for conflict resolution, then decoding accuracy improves, but computational complexity increases
Solution Approach 1:
The patent applies local quality by generating potential right-to-left tables specifically at conflict locations rather than uniformly across all decoding positions. Each potential table is created only where conflicts are detected, providing locally optimized accuracy improvements without globally increasing computational complexity.
Data Source
AI summary
Various embodiments of the present disclosure provide methods and apparatuses for improved belief propagation (BP) decoding. A method performed by a receiver comprises: obtaining based on received information and an original left-to-right table comprising left-to-right messages associated with nodes of a plurality of processing elements (PEs) for BP decoding, an original right-to-left table comprising right-to-left messages associated with the nodes, and searching for, based on the original left-to-right table and the original right-to-left table, a conflict verification processing element (VPE) in the plurality of PE. The method also comprises updating the original right-to-left table based on the conflict VPE to obtain a plurality of potential right-to-left tables, and performing the BP decoding based on the respective one of the plurality of potential right-to-left tables.