Polar Code Shared-Node Decoding for Low-Delay Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing decoding algorithms for polar codes, such as successive-cancellation (SC) and SC-List (SCL), face long delay times due to sequential calculation and low throughput when determining multiple bits simultaneously.
Innovation Solution
A method and apparatus for decoding polar codes using shared nodes, where input nodes are sorted into three categories (first, second, and third nodes) based on bit patterns, allowing for simultaneous determination of multiple bits by calculating codeword candidates and path metrics, thereby reducing delay time and increasing throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential decoding algorithms (SC or SCL) are used to ensure accurate bit determination, then decoding reliability is maintained, but delay time increases due to sequential calculation
Solution Approach 1:
The patent divides the polar code decoding process into multiple stages, where each stage determines a specific number of bits simultaneously rather than sequentially. The decoder is segmented into parallel processing units that can handle multiple bits in each clock cycle, breaking down the sequential bottleneck while maintaining accuracy through staged verification
Solution Approach 2:
The patent performs preliminary sorting and categorization of bits into different groups (first group, second group, third group) based on their reliability metrics before decoding. This preliminary organization allows the decoder to process more reliable bits in parallel while reserving sequential processing for less reliable bits, reducing overall delay time while maintaining decoding reliability
2Productivity
If multiple bits are determined simultaneously to reduce delay time, then throughput increases, but decoding accuracy deteriorates due to increased complexity in path metric selection
Solution Approach 1:
The patent applies different decoding strategies to different groups of bits based on their local characteristics. The first group of bits (most reliable) uses simplified parallel determination, the second group uses intermediate processing with path metric comparison, and the third group uses more rigorous sequential verification. This localized quality approach maintains accuracy for critical bits while enabling high throughput for less critical bits
Solution Approach 2:
The patent dynamically adjusts the number of candidate paths and verification depth based on the reliability parameters of different bit groups. For bits with high reliability metrics, fewer candidate paths are maintained, reducing complexity. For bits with lower reliability, more candidate paths and deeper verification are applied, ensuring accuracy. This parameter adaptation allows simultaneous multi-bit determination without sacrificing decoding accuracy
3Reliability
If more candidate paths are created to improve decoding accuracy, then reliability increases, but delay time increases due to path arrangement overhead
Solution Approach 1:
The patent performs preliminary sorting and filtering of candidate paths based on path metrics before full path arrangement is required. By pre-organizing paths according to their reliability scores and eliminating clearly inferior paths early in the process, the system reduces the computational burden of subsequent path arrangement operations, thereby reducing delay time while maintaining the ability to select the most reliable paths
Solution Approach 2:
The patent implements a truncated path arrangement approach where only the top K candidate paths (where K is less than the total number of possible paths) are fully processed and arranged. This partial action approach creates a trade-off where not all possible paths are exhaustively evaluated, reducing delay time while still maintaining high decoding accuracy by focusing computational resources on the most promising candidate paths
Data Source
AI summary
The present disclosure a method of decoding a polar code based on a shared node, the method includes extracting an input node from target data that are data to be decoded, by an extractor, sorting the input node as one of a first node of which the pattern of the frozen bit satisfies a predetermined first reference, a second node of which the pattern of the information bit satisfies a predetermined second reference, and a third node that is not the first node and the second node, by a sorter, calculating at least one codeword candidate and at least one path metric that correspond to the input node in accordance with the sorting result by a calculator, finishing decoding the target data by iterating the extracting, the sorting as one, and the calculating of at least one path metric by a controller.