CRC Bit Interleaving for Low-Latency Polar Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In 6G wireless communication systems, the increased complexity of decoding encoded signals due to concatenated redundancy bits leads to high latency and block error rates, particularly when using search tree schemes, as the search space expands and re-searching paths becomes time-consuming.
Innovation Solution
A method involving a transmitting node that encodes information bits using cyclic redundancy check (CRC) bits, interleaves them using a specific pattern, and performs convolution- and polar-encoding to generate a codeword, which is then transmitted to a receiving node, where the CRC bits are decoded using an interleaving pattern corresponding to a matrix based on the size of the information and CRC bits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundancy bits are concatenated after information bits for encoding, then error detection capability is improved, but decoding complexity and search space increase leading to higher latency
Solution Approach 1:
The patent divides the concatenated bit sequence into separate information bits and redundancy bits using a defined interleaving pattern. The receiver uses this same pattern to segment the received sequence, allowing independent processing of information and redundancy components, thereby reducing the search space while maintaining error detection capability.
Solution Approach 2:
The interleaving pattern is predetermined and agreed upon between transmitter and receiver before communication occurs. This preliminary arrangement allows the receiver to directly map received bits to their respective positions without exhaustive search, reducing decoding latency while preserving the error detection function of the concatenated redundancy bits.
2Reliability
If redundancy bits are concatenated after information bits for encoding, then error detection capability is improved, but device complexity increases due to expanded search space
Solution Approach 1:
The patent segments the bit sequence using a predetermined interleving pattern that separates information bits and redundancy bits into distinct positions. This segmentation allows the decoder to process each type of bit independently according to its specific requirements, reducing overall decoding complexity while maintaining the error detection capability provided by the concatenated redundancy bits.
Solution Approach 2:
The patent changes the arrangement parameter of the bit sequence by applying a specific interleving pattern during encoding and the corresponding de-interleving pattern during decoding. This parameter transformation optimizes the structure for efficient processing, reducing device complexity while preserving the functional benefits of concatenated redundancy bits for error detection.
3Measurement precision
If search tree scheme is used for decoding, then decoding accuracy is improved, but latency increases due to time-consuming re-searching paths
Solution Approach 1:
The patent applies a predetermined interleving pattern during encoding that structures the bit sequence to facilitate more efficient search tree decoding. By pre-organizing the bits according to this pattern, the receiver can perform the search tree algorithm with reduced branching factors and fewer nodes to explore, thereby maintaining decoding accuracy while reducing the time required for re-searching paths.
Data Source
AI summary
The present disclosure relates to a 5G communication system or a 6G communication system for supporting higher data rates beyond a 4G communication system such as long term evolution (LTE). A method performed by a transmitting node in a wireless communication system may include encoding a plurality of information bits using a plurality of cyclic redundancy check (CRC) bits, interleaving the plurality of the information bits and the plurality of the CRC bits using an interleaving pattern, generating a codeword by convolution-encoding and polar-encoding the plurality of the interleaved information bits and the plurality of the interleaved CRC bits, and transmitting the codeword to a receiving node. The interleaving pattern may correspond to a matrix generated based on a size of the plurality of the information bits and a size the plurality of the CRC bits.