Polar Code Construction for Non-Power-of-Two Lengths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data encoding and decoding methods using polar codes and subcodes face performance issues, particularly in constructing codes of varying lengths and achieving optimal performance through techniques like shortening, puncturing, and concatenation, which result in complex code construction and unsatisfactory performance for practical applications.
Innovation Solution
The proposed solution involves an encoding apparatus and method that uses a processor to encode data into a codeword of length n=2m1+...+2ms using a C(n, k, d) code, where the precoding matrix A is constructed from nested linear block codes and extended Bose-Chaudhuri-Hocquenghem codes, with dynamic frozen symbols and error probability-based constraints to optimize code construction and decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If polar codes with practical parameters are used, then the coding scheme is simple and implementable, but the performance is unsatisfactory
Solution Approach 1:
The patent embeds polar codes within a larger structured framework by nesting them inside block codes with specific generator matrices. The polar code is constructed as a subset of a block code, where the block code's structure provides additional constraints and properties that enhance performance while maintaining the simplicity of polar code implementation. This nested structure allows the code to benefit from both the capacity-achieving property of polar codes and the performance advantages of structured block codes.
2Adaptability or versatility
If shortening and puncturing techniques are applied to obtain codes of non-power-of-two length, then code length flexibility is improved, but code construction complexity increases
Solution Approach 1:
The patent segments the code construction process into distinct stages: first constructing a block code with a specific generator matrix structure, then selectively shortening or puncturing specific positions based on the frozen bit pattern. This segmentation allows for systematic control over code length while maintaining a regular construction procedure. The generator matrix is designed with a specific structure that facilitates easy shortening and puncturing operations without requiring complex re-optimization.
3Adaptability or versatility
If heavily shortened or punctured codes are used, then code length adaptability is improved, but performance satisfaction deteriorates
Solution Approach 1:
The patent applies local quality by differentiating between different positions in the code based on their error probability characteristics. Frozen bits are placed at positions with higher error probabilities, while information bits are placed at positions with lower error probabilities. When shortening or puncturing is applied, specific positions are selected based on their local characteristics rather than uniformly affecting all positions. This localized approach ensures that the most critical parts of the code maintain their error correction capabilities even when the code length is reduced.
Data Source
AI summary
An encoding apparatus includes a processor a non-transitory computer-readable storage medium storing a program for encoding data into a codeword. The program includes instructions to encode the data x using a code that is a product of a matrix generated using the Kronecker product of the Q with itself and factors generated according to frozen bit indices of the code and a constraint matrix generated according to a precoding matrix.


