Distributed CRC Polar Codes Without Gaussian Elimination Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating CRC matrices for polar codes in communication systems require complex Gaussian elimination, leading to significant computing overhead, especially when the information block size changes.
Innovation Solution
A method to determine a cyclic redundancy check (CRC) generator sequence that enables early termination of polar encoded sequences by distributing CRC bits within the control information values, using a selected part of the CRC generator sequence, and polar encoding the combined sequence.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Gaussian elimination methods are used to transform the CRC generator matrix to an upper triangle like matrix, then the CRC distribution performance is improved, but the computing complexity overhead increases significantly
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing the transformation matrices (Q and P) and interleaving patterns for different information block sizes before actual communication occurs. These pre-computed structures are stored in memory and directly applied during encoding, eliminating the need for real-time Gaussian elimination and significantly reducing computing complexity while maintaining optimal CRC distribution.
2Reliability
If row and column swapping is performed to obtain an upper triangle like matrix, then each CRC bit can be placed after the bits on which it depends, but the processing time increases
Solution Approach 1:
The patent resolves this time-consuming operation by pre-computing the row and column permutation patterns (stored as matrices Q and P) for all possible information block sizes. These permutation patterns are stored in memory and directly applied during encoding without performing actual row and column swapping operations in real-time, thus maintaining optimal CRC bit positioning while minimizing processing time.
3Adaptability or versatility
If the CRC generator matrix is regenerated for each information block size, then the CRC distribution adapts to different payload sizes, but the energy consumption increases
Solution Approach 1:
The patent addresses energy consumption by pre-computing and storing the CRC generator matrix transformations and interleaving patterns for all supported information block sizes before communication begins. During actual encoding, the system simply retrieves and applies the pre-computed structures corresponding to the current payload size, avoiding repeated regeneration of matrices and significantly reducing energy consumption while maintaining full adaptability to different payload sizes.
Data Source
Figure 1
Figure 2~3
Figure 4
AI summary
A method comprising: determining a cyclic redundancy check (CRC) generator sequence defining a one to one mapping between a sequence of control information values and cyclic redundancy check (CRC) sequence values; and determining a combined sequence, the combined sequence formed by distributing the cyclic redundancy check (CRC) value sequence within the sequence of control information values, wherein the distributing the cyclic redundancy check (CRC) value sequence within the sequence of control information values is based on a selected part of the cyclic redundancy check (CRC) generator sequence.