Polar Code Interleaving With PBR Matrix Permutation for Burst Errors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel encoding methods, particularly polar codes, face challenges in achieving effective data randomization and error correction in higher order modulation and fading channels, where burst errors are not adequately addressed by existing interleaving techniques.
Innovation Solution
A channel interleaving method using a pruned bit reverse (PBR)-based mapping for column and row sequence numbers in a matrix, which permutes and reads bits to enhance interleaving randomization and performance, improving the channel error correction capability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional interleaving methods are used for polar code encoding, then the implementation is simpler, but the interleaving randomization is insufficient and burst errors cannot be effectively dispersed
Solution Approach 1:
The interleaving process is segmented into two distinct stages: first writing data bits into a matrix in natural order, then reading them out in a permuted order determined by PBR-based permutation patterns. This segmentation allows the system to achieve strong randomization through the permutation stage while keeping the writing stage simple and deterministic.
Solution Approach 2:
The permutation patterns are pre-calculated using PBR-based mapping and stored in a lookup table before the actual interleaving operation. This preliminary action eliminates the need for complex real-time calculations during data processing, reducing implementation complexity while maintaining high randomization performance.
2Reliability
If random interleaving is used to achieve better error correction, then the interleaving performance improves, but the implementation complexity increases significantly
Solution Approach 1:
Instead of implementing complex random number generation and probabilistic algorithms, the patent uses predetermined permutation patterns generated by PBR-based mapping. These patterns act as disposable, pre-computed instructions that provide effective randomization without the overhead of complex runtime algorithms, achieving good error correction with lower implementation complexity.
Solution Approach 2:
The patent changes the parameter of permutation generation from random number generation to deterministic PBR-based mapping. This parameter change transforms the interleaving process from a probabilistic algorithm to a deterministic one, maintaining the dispersal effect needed for error correction while significantly simplifying the implementation.
3Productivity
If higher order modulation is used to increase data rate, then the productivity improves, but the anti-interference performance deteriorates due to insufficient error correction
Solution Approach 1:
The patent introduces a two-dimensional matrix structure for data organization, transforming the one-dimensional data stream into a 2D arrangement. This dimensional change enables more effective permutation and dispersal of data bits, improving error correction capability without reducing the data transmission rate achieved through higher order modulation.
Data Source
AI summary
The present invention provides channel interleaving method of a polar (Polar) code. The method includes: determining an M_r-row and M_c-column matrix used for interleaving, and permutating, based on permutation patterns of the column sequence numbers and/or permutation patterns of the row sequence numbers, the matrix into which the to-be-interleaved bits are written. The permutation patterns of the column sequence numbers are represented by: [Pc(0), Pc(1), . . . , Pc(ic), . . . , Pc(M_c−1)]. Pc(ic) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)-based mapping on the column sequence number ic. The permutation patterns of the row sequence numbers are represented by: [Pr(0), Pr(1), . . . , Pr(ir), . . . , Pr(M_r−1)]. Pr(ir) is obtained by performing pruned bit reverse (PBR, pruned bit reverse)-based mapping on the row sequence number ir; and reading interleaved bits from the permutated matrix.