Polar Code Frozen-Bit Layout for Matrix-Guided Low-Latency Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The high decoding latency of polar codes in communication systems due to the lack of effective application of their automorphism group in decoding processes, which is hindered by the incomplete understanding of the automorphism group of polar codes.
Innovation Solution
Designing polar codes with frozen bits that support a predefined set of automorphisms based on a binary upper triangular matrix, allowing for efficient automorphism-based decoding with reduced latency and improved Block Error Rate (BLER) performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional successive cancellation decoding algorithm is used for polar codes, then decoding can be performed with explicit construction, but decoding latency remains high
Solution Approach 1:
The patent applies preliminary action by pre-configuring frozen bits to support a predefined set of automorphisms before decoding occurs. The encoding apparatus configures frozen bits to support automorphisms based on a binary upper triangular matrix, enabling the decoding apparatus to directly apply these pre-established automorphisms during decoding, thereby reducing decoding latency without requiring complex real-time computations
Solution Approach 2:
The patent substitutes the mechanical successive cancellation decoding process with an automorphism-based decoding approach. Instead of sequentially processing bits through complex cancellation operations, the system uses algebraic automorphisms of the polar code structure to transform and decode codewords, replacing iterative mechanical decoding with more efficient algebraic transformations
2Loss of time
If automorphism-based decoding is applied to polar codes, then decoding latency can be reduced, but it requires complete knowledge of the automorphism group which is currently incomplete
Solution Approach 1:
The patent applies parameter changes by modifying the frozen bit configuration to support specific automorphisms defined by a binary upper triangular matrix. By changing the parameters of the polar code (specifically the frozen bit positions and values) to align with the automorphism structure, the system enables efficient automorphism-based decoding without requiring complete characterization of the entire automorphism group
Solution Approach 2:
The encoding apparatus performs preliminary configuration of frozen bits to support a predefined set of automorphisms before transmission. This advance preparation allows the decoding apparatus to utilize these pre-configured automorphisms for efficient decoding, eliminating the need for complete real-time analysis of the automorphism group structure
Data Source
AI summary
The present disclosure relates generally to the field of data encoding and decoding, and particularly to automorphism-based polar encoding and decoding apparatuses and methods, as well as computer program products embodying the method steps in the form of computer codes. More specifically, polar codes are designed such that their frozen bits support automorphisms described by a binary upper triangular matrix having a diagonal including at least one of zeros and units. Codewords generated using these polar codes may be subsequently subjected to automorphism-based polar decoding in an efficient manner and with a lower decoding latency compared to the conventional Successive Cancellation List decoding algorithms. Furthermore, the efficiency of the automorphism-based polar decoding may be increased even more if the automorphisms are based on matrix elements arranged above the diagonal in a vicinity of a bottom right corner of the binary upper triangular matrix.