Polar Code Interleaving Matrix for Long-Code Reading Simplicity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing polar code-based interleaving methods face complexity in implementing and reading sequences when the code length is long, requiring significant storage space and complex permutation sequence management.
Innovation Solution
A polar code-based interleaving method that determines an interleaving matrix based on the target code length, using unit matrices and specific algorithms like Kronecker product or double-matrix superposition to simplify the interleaving process, thereby improving anti-interference performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If random interleaving is used to improve anti-interference performance, then error-correcting capability is improved, but implementation complexity increases when code length is long
Solution Approach 1:
The patent changes the interleaving parameter from random permutation to a structured pattern based on matrix operations. Specifically, it uses a matrix where elements are arranged according to a mathematical pattern (row-major or column-major ordering) rather than random shuffling, maintaining the dispersal effect while enabling systematic generation and reduction of complexity.
Solution Approach 2:
The patent replaces the mechanical process of storing and managing permutation sequences with a mathematical model. Instead of maintaining a lookup table of permuted indices, the system uses matrix multiplication and transposition operations that can be computed on-the-fly, eliminating the need for pre-stored permutation data and reducing memory requirements.
2Reliability
If random interleaving is used to discretize burst errors, then error-correcting capability is improved, but storage space requirements increase
Solution Approach 1:
The patent replaces the storage-intensive permutation sequence table with a compact mathematical representation. The interleaving pattern is defined by a small set of matrix parameters (dimensions and ordering rule) rather than requiring storage of all permuted indices, dramatically reducing memory footprint while maintaining the error-dispersal function.
Solution Approach 2:
The patent uses matrix transposition to generate the interleaving pattern without explicitly storing it. Instead of copying and storing the entire permuted sequence, the system computes the pattern through matrix operations, effectively creating the permutation on-demand and avoiding redundant storage.
3Reliability
If complex permutation sequences are used for interleaving, then anti-interference performance is improved, but reading and processing becomes more complex
Solution Approach 1:
The patent changes the reading operation from complex sequence lookup to simple matrix traversal. By organizing data in a matrix structure with regular ordering patterns, the reading process becomes a systematic traversal (row-by-row or column-by-column) rather than following an irregular permutation sequence, significantly simplifying the operation.
Solution Approach 2:
The patent segments the interleaved data into a matrix structure with clear row and column boundaries. This segmentation allows the reading process to be broken down into simple, repetitive operations of traversing matrix elements in a predictable pattern, making the implementation more straightforward and easier to manage.
Data Source
Figure 1~3
Figure 4~5
Figure 6
AI summary
This application discloses a polar code-based interleaving method and apparatus, to resolve a problem existing in the prior art that when a code length is relatively long, an implementation process of reading a sequence obtained after random interleaving is relatively complex. The method includes: determining an interleaving matrix based on a target code length M of a polar code; and interleaving, based on the interleaving matrix, encoded bits obtained after encoding of the polar code, to generate interleaved bits.