Polar Code CRC Interleaving for Early Blind Detection Termination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Polar code decoding processes exhibit high decoding delay and complexity due to the sequential nature of the decoding algorithm, which is exacerbated in 5G systems where control channel decoding is combined with blind detection processes.
Innovation Solution
The method involves filling a predetermined number of CRC check bits into interleaved padding positions in the coded sequence, allowing for simultaneous decoding and CRC checking, reducing the decoding delay and complexity by transforming the complete binary tree into a minimum incomplete binary tree and determining specific node types for efficient processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential polar code decoding algorithm is used, then decoding accuracy is maintained, but decoding delay and complexity increase significantly
Solution Approach 1:
The patent segments the decoding process by dividing the binary tree into multiple layers and identifying specific node types (Rate0, Rate1, REP, SPC nodes). This segmentation allows the decoder to process different node types using optimized algorithms, enabling early termination at certain layers without compromising overall decoding accuracy, thus reducing decoding delay while maintaining reliability
Solution Approach 2:
The patent applies partial action by performing decoding operations only on necessary node types and layers. By identifying and processing only Rate0, Rate1, REP, and SPC nodes with specific algorithms, and allowing early termination when certain conditions are met, the system achieves adequate decoding performance with reduced computational effort and time, rather than exhaustively processing the entire binary tree
2Reliability
If sequential polar code decoding algorithm is used, then decoding accuracy is maintained, but decoding complexity increases
Solution Approach 1:
The patent reduces decoding complexity by segmenting the binary tree structure into distinct node types (Rate0, Rate1, REP, SPC nodes) and layers. Each node type has dedicated processing rules, allowing the decoder to skip unnecessary computations and focus only on relevant nodes, thereby simplifying the overall decoding process while maintaining accuracy
Solution Approach 2:
The patent applies local quality by assigning different processing strategies to different node types within the binary tree. Rate0 nodes use one algorithm, Rate1 nodes use another, and REP/SPC nodes have specific handling rules. This localized optimization reduces the overall decoding complexity by avoiding uniform processing of all nodes, while preserving the accuracy required for each specific node type
3Reliability
If CRC check bits are added for error detection, then reliability improves, but coding complexity and processing overhead increase
Solution Approach 1:
The patent merges the CRC check bit insertion process with the polar coding process by integrating CRC bit placement into the binary tree structure construction. Instead of treating CRC insertion as a separate step, the method combines it with node type identification and codebook generation, reducing coding complexity while maintaining error detection capability through unified processing
Data Source
AI summary
The present disclosure provides a polar code coding method, a polar code decoding method, apparatus and device. The polar code coding method includes: obtaining a plurality of CRC check bits; determining interleaved padding positions in a to-be-coded sequence; filling a first predetermined number of CRC check bits of the plurality of CRC check bits into the interleaved padding positions in the to-be-coded sequence in an interleaving manner; and performing polar coding on the to-be-coded sequence that is filled with the predetermined number of CRC check bits in interleaving manner, and transmitting a coded sequence to a receiving end. The first predetermined number is less than or equal to a total number of the plurality of CRC check bits.