Polar Code Decoding with Parallel U-Value Calculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing Polar decoding schemes face challenges with high computing resource overhead and large coding delay due to segmentation of data, which affects the efficiency of channel encoding in wireless communication systems, particularly in 5G communication systems.
Innovation Solution
The method involves splitting the Polar code tree into independent decoding sub-trees and distributing the U value calculation across multiple modules for parallel processing, allowing each sub-tree to be calculated independently without dependency, thereby improving decoding efficiency and reducing resource overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Use of energy by moving object
If Polar decoding is performed on data in segments to save computing resources, then computing resource overhead is reduced, but coding delay becomes too large
Solution Approach 1:
The patent divides the Polar code tree into multiple independent decoding sub-trees, allowing parallel decoding operations on different segments of data. This segmentation enables computing resources to be distributed across multiple independent processing units, reducing the computing resource overhead for each individual segment while maintaining overall decoding performance.
Solution Approach 2:
The patent introduces a parallel processing dimension by creating multiple independent U value calculation modules that operate simultaneously on different sub-trees. This dimensional transformation from sequential to parallel processing reduces coding delay while distributing computing resources across multiple modules, resolving the contradiction between resource overhead and delay.
2Use of energy by moving object
If data is segmented for Polar decoding, then computing resources are saved, but process data storage overhead increases
Solution Approach 1:
By segmenting the Polar code tree into independent sub-trees, the patent reduces the amount of data that needs to be stored and processed at each decoding stage. Each sub-tree processes a smaller portion of the overall data, reducing per-segment storage overhead while the parallel structure maintains efficient resource utilization.
Solution Approach 2:
The independent sub-tree structure allows intermediate results from each segment to be processed and discarded independently, reducing the need to maintain large buffers for all segments simultaneously. This approach minimizes process data storage overhead while preserving necessary information for final decoding.
3Reliability
If successive cancellation algorithm is used for Polar decoding, then decoding performance reaches Shannon limit, but decoding delay increases
Solution Approach 1:
The patent segments the successive cancellation decoding process into multiple independent sub-trees, allowing parallel execution of the algorithm. This maintains the theoretical performance benefits of successive cancellation while reducing overall decoding delay through concurrent processing of multiple data segments.
Solution Approach 2:
By introducing parallel processing dimensions with multiple independent U value calculation modules, the patent transforms the sequential successive cancellation algorithm into a parallel architecture. This dimensional change preserves the algorithm's ability to reach Shannon limit while significantly reducing decoding delay through simultaneous operations.
Data Source
AI summary
Disclosed are a data decoding method and apparatus, and a computer storage medium. The data decoding method includes: after Polar code data to be decoded is acquired, transmitting the Polar code data to be decoded to at least two pre-configured independent U value calculation modules, the U value calculation modules being configured to calculate a U value required at a next iteration of a G node; controlling the at least two independent U value calculation modules to process the Polar code data to be decoded to obtain at least two sets of new decode data; and, processing the at least two sets of new decode data to obtain new Polar code data to be decoded.