Polar Code Encoding Structure for Parallel Decoding Delay Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel encoding methods, such as polar codes, result in long decoding delays due to the need for serial decoding of bit sequences, which is inefficient in meeting the demands of 5G communication scenarios like eMBB, mMTC, and URLLC.
Innovation Solution
An encoding method that constructs a binary vector P1 based on binary vectors P2 and P3 of second and third codes, allowing for parallel decoding by determining the code lengths and information bit quantities such that n1=n2*n3 and k1=k2*k3, facilitating the reduction of decoding delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If polar code encoding is used to achieve reliable data transmission, then transmission reliability is improved, but decoding delay increases due to serial decoding requirement
Solution Approach 1:
The patent segments the binary vector P1 into multiple sub-vectors (P2 and P3) that can be independently processed. By dividing the encoding task into parallel segments, the system enables simultaneous decoding operations on different portions of the data, thereby reducing overall decoding delay while maintaining the reliability benefits of polar code encoding
Solution Approach 2:
The patent transforms the traditional single-dimension serial decoding approach into a multi-dimensional parallel processing structure. By organizing the binary vector relationships in terms of code lengths (n1=n2*n3) and information bit quantities (k1=k2*k3), the system creates additional processing dimensions that allow concurrent decoding operations
2Measurement precision
If serial decoding is performed on all information bits to ensure accurate decoding, then decoding accuracy is improved, but decoding speed decreases
Solution Approach 1:
The patent divides the information bit sequence into multiple segments corresponding to different sub-vectors of the binary vector P1. Each segment can be decoded independently and simultaneously, maintaining decoding accuracy through proper segment organization while significantly increasing decoding speed through parallel processing
Solution Approach 2:
The patent applies partial action by processing different portions of the information bits simultaneously through parallel decoding paths. Instead of sequentially processing all bits through a single decoding chain, the system activates multiple decoding operations on relevant segments at the same time, achieving both accuracy and speed
3Loss of time
If a new encoding method is developed to enable parallel decoding, then decoding delay is reduced, but encoding complexity increases
Solution Approach 1:
The patent structures the binary vector P1 as a combination of smaller sub-vectors (P2 and P3) with defined relationships (n1=n2*n3, k1=k2*k3). This segmentation allows the encoding process to follow a systematic pattern rather than requiring complex arbitrary transformations, reducing encoding complexity while enabling parallel decoding
Solution Approach 2:
The patent performs preliminary organization of the binary vector structure before the actual encoding and decoding operations. By pre-defining the relationships between sub-vectors and their dimensions, the system prepares the data structure in advance to facilitate parallel processing, reducing the complexity of the main encoding/decoding operations
Data Source
AI summary
Embodiments disclose an encoding method and a communications device. The method includes: obtaining and encoding a to-be-encoded information bit sequence based on a binary vector P1 of a first code, to obtain and output an encoded bit sequence, where P1 is determined based on a binary vector P2 of a second code and a binary vector P3 of a third code, P1, P2, and P3 indicate an information bit and a frozen bit of the first code, the second code and the third code respectively, a code length of the first code, the second code and the third code is n1, n2 and n3 respectively, a quantity of information bits of the first code, the second code and the third code is k1, k2 and k3 respectively, n1=n2*n3, and k1=k2*k3. Therefore, parallel decoding can be performed, helping reduce a decoding delay.