Polar Decoding Blind Detection With Nested Code-Length Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing polar decoding methods face high complexity due to the need for blind detection, which involves traversing all possible combinations of code length and information bit length, leading to excessive computational overhead.
Innovation Solution
The proposed method simplifies polar decoding by utilizing the nested feature of polar codes, where a subset of encoding parameters is selected based on the largest information bit length, reducing the number of candidate parameters for blind detection and thereby decreasing computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blind detection is performed by sequentially traversing all possible combinations of code length N and information bit length K, then decoding accuracy is maintained, but decoding computation amount increases excessively
Solution Approach 1:
The patent applies the nesting principle by organizing polar code decoding through nested loops where an outer loop iterates through candidate code lengths N and an inner loop iterates through candidate information bit lengths K. This structured nesting allows the decoder to systematically test multiple parameter combinations while maintaining the ability to early-terminate when successful decoding is achieved, thereby balancing decoding accuracy with reduced computational complexity compared to exhaustive traversal.
2Adaptability or versatility
If all possible combinations of code length N and information bit length K are traversed during blind detection, then complete parameter search is achieved, but the quantity of blind detection times becomes excessively large
Solution Approach 1:
The patent applies preliminary action by performing channel estimation and reference signal processing before the blind detection process begins. Additionally, the nested loop structure with early termination capability allows the system to prepare and test candidate parameters in a predetermined sequence, stopping the search as soon as valid decoding is achieved. This preliminary preparation and structured approach reduces the actual number of detections needed while maintaining complete parameter search capability.
3Reliability
If sequential traversal of all N and K combinations is performed, then blind detection coverage is maximized, but decoding complexity increases
Solution Approach 1:
The patent implements nested loops where code length N candidates are processed in an outer loop and information bit length K candidates are processed in an inner loop. This nesting structure organizes the blind detection process systematically, allowing the decoder to maintain comprehensive coverage of all parameter combinations while implementing early termination to reduce actual computational complexity. The nested structure enables methodical exploration of the parameter space without requiring exhaustive traversal of all possibilities.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Disclosed are a polar decoding method and apparatus. The method includes: obtaining a polar code sequence; determining at least one first information bit length corresponding to a code length of the polar code sequence; and decoding the polar code sequence based on blind detection by using the code length and the at least one first information bit length. The at least one first information bit length is a part of a preset information bit length set corresponding to the code length, a remaining part of the preset information bit length set is at least one second information bit length, the at least one second information bit length is excluded from being used for the blind detection, and each second information bit length is less than one or more information bit lengths in the at least one first information bit length. By using this solution in polar decoding, complexity of the polar decoding based on blind detection is reduced.