Distributed CRC Polar Coding for Low-Complexity Early Termination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating CRC generator matrices for polar codes in communication systems require significant computational overhead due to the need for Gaussian elimination, especially when handling varying information block sizes, which increases processing complexity and energy consumption.
Innovation Solution
A method that determines a cyclic redundancy check (CRC) generator sequence based on a maximum control information block size, allowing for a simpler distribution pattern generation by selecting rows from the CRC generator matrix in a bottom-to-top order, enabling early termination of polar encoded sequences through efficient CRC bit distribution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Gaussian elimination methods are applied 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 pre-calculates and stores the CRC generator matrix in upper triangle form for each possible information block size before actual communication occurs. This preliminary preparation eliminates the need for real-time Gaussian elimination during encoding and decoding operations, thus resolving the contradiction between achieving good CRC distribution performance and maintaining low computing complexity overhead.
2Reliability
If the CRC generator matrix is regenerated for each information block size, then the CRC distribution is optimized for each block size, but the processing time increases
Solution Approach 1:
The patent creates a universal lookup table containing pre-computed CRC generator matrices for all possible information block sizes. This single universal structure serves multiple functions by providing optimized CRC distribution for any block size without requiring separate processing, thus resolving the contradiction between optimizing CRC distribution for each block size and reducing processing time.
3Use of energy by moving object
If early termination of decoding is enabled through distributed CRC bits, then energy consumption is reduced, but the decoding accuracy may be compromised
Solution Approach 1:
The patent strategically places CRC bits at specific positions in the polar code sequence where they can provide early error detection capability. By distributing CRC bits to specific locations rather than uniformly, the system enables early termination at optimal points without compromising overall decoding accuracy, thus resolving the contradiction between reducing energy consumption and maintaining decoding precision.
Data Source
AI summary
A method including 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.