Chained Polar Code Construction for Finite-Length Error Correction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Polar codes, despite being competitive with state-of-the-art error correction codes, face limitations in achieving channel capacity at finite code lengths and are computationally complex, particularly in wireless communications where code lengths are impractical.
Innovation Solution
The introduction of chained polar codes, which utilize a chained generator matrix constructed by applying a chaining matrix to a base generator matrix, enhancing polarization and error correction performance through recursive construction and improved bit allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional polar codes are used, then encoding complexity is low, but error correction performance is limited at finite code lengths
Solution Approach 1:
The generator matrix is segmented into multiple blocks, where each block corresponds to a subset of bit channels. This segmentation allows independent optimization of each block's generator matrix entries, enabling improved error correction performance through selective modification of specific matrix elements without requiring complete redesign of the entire coding system.
Solution Approach 2:
Different blocks of the generator matrix are assigned different local qualities by modifying specific entries in each block based on the reliability of corresponding bit channels. This local quality adjustment allows the system to optimize error correction for specific bit positions while maintaining overall encoding efficiency, addressing the contradiction between reliability improvement and complexity increase.
2Reliability
If code length is increased to approach channel capacity, then error correction performance improves, but computational complexity increases
Solution Approach 1:
Instead of uniformly increasing code length across all bit channels, the invention applies partial action by selectively modifying generator matrix entries only for blocks corresponding to bit channels that benefit most from such modifications. This partial action achieves improved channel capacity approach at finite lengths without the full computational burden of increasing overall code length.
Solution Approach 2:
The invention changes parameters of the generator matrix (specifically, the entries in different blocks) to optimize performance at finite code lengths. By adjusting matrix parameters based on bit channel reliability characteristics, the system achieves better error correction performance without requiring proportional increases in code length, thus managing computational complexity.
3Reliability
If generator matrix entries are modified to enhance polarization, then error control improves, but deviation from standard polar code structure increases
Solution Approach 1:
The generator matrix is divided into multiple blocks, allowing polarization enhancement to be applied selectively to specific blocks rather than uniformly across the entire matrix. This segmentation maintains a structure closer to standard polar codes in blocks where modification is less critical, while enhancing polarization in blocks where it provides maximum benefit, thus balancing structure preservation with performance improvement.
Solution Approach 2:
Different blocks of the generator matrix exhibit different local qualities in terms of polarization characteristics. The invention modifies entries locally in each block based on the specific polarization needs of corresponding bit channels, enhancing overall polarization strength while maintaining a structured approach that deviates minimally from standard polar code construction.
Data Source
AI summary
Methods and apparatuses for implementing error-correction in communication systems, particularly wireless communication systems. Input bits are encoded according to a chained generator matrix to generate a codeword, and the codeword is transmitted. The chained generator matrix includes a first subset of entries corresponding to a first subset of entries in a base generator matrix for a chained polar code, and a second subset of entries that are different from a second subset of entries in the base generator matrix. A chained generator matrix could be constructed, for example, by applying a chaining matrix to the second subset of entries in the base generator matrix, to produce the second subset of entries in the chained generator matrix.