Supercharge Your Innovation With Domain-Expert AI Agents!
Polar code SC decoding-based partial sum method
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A technology of polar codes and polar codes, which is applied in some fields and can solve problems such as complex operations of polar codes
Active Publication Date: 2015-12-09
HARBIN INST OF TECH
View PDF5 Cites 29 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0004] The purpose of the present invention is to solve the problem of complex operation in the decoding process of polar code, and propose a part and method based on polar code SC decoding
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
specific Embodiment approach 1
[0023] Specific Embodiment 1: A part and method based on polar code SC decoding of this embodiment is specifically prepared according to the following steps:
[0024] Step 1, for the figure 2 The input signal of N information bits According to the coding direction Perform hierarchical polarization coding, define i as the level label, Polar encoding direction is from i=1,2,3,...,n; SC decoding direction is from i=n,n-1,n-2,...,1, required during SC decoding Calculation of partial sums; where N=2 n
[0025] Step 2. Define V 1 N is the sequence of partial sum calculations, V 1 N The maximum term of a sequence is both the partial sum
[0026] in, P i is the calculation matrix of the partial sum, that is, an N×N square matrix; s iN is the partial sum of the Nth node of the i-th level;
[0027] Step 3. Using the generation rules of partial sums to calculate the partial sums to generate sequence expressions V 1 N deduce, get ( v ...
specific Embodiment approach 2
[0040] Specific implementation mode two: the difference between this implementation mode and specific implementation mode one is: define V in step two 1 N is the sequence-specific process of partial sum computation:
[0041] (1), set V 1 ( 2 n - 2 ) = ( v ( 2 n - 2 ) v ( 2 n - 3 ) ... v 1 ) = ( u ( ...
specific Embodiment approach 3
[0048] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is that in step three, the generation rule of partial sum is used to generate the sequence expression V for the calculation of partial sum 1 N deduce, get ( v ( 2 n ) ( k ) v ( 2 n - 1 ) ( k ) ... v 1 ( k ) ) = ( u ( 2 n ) u ...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention relates to a polar code SC decoding-based partial sum method. The objective of the invention is to solve the problem of complex computation in a decoding process of polar codes. The method includes the following steps that: as for the input signals U<N>1 of N information bits, hierarchical polarization coding is performed on U<N>1 according to a coding direction, wherein U<N>1 is expressed by an equation described in the descriptions of the invention; V<N>1 is the sequence of partial sum computation, the maximal term of the V<N>1 is partial sum S<N>il=U<N>1Pi; a computation generation sequence expression V<N>1 of the partial sum is inferred through utilizing the generation rules of the partial sum; the computation rules of T1,T2...Tk is proved through utilizing an induction method; and a bit estimated value u<^>i=hi(y<N>1, u<^i-1>1) is determined; and the likelihood ratio (LR) of an N-dimensional channel is determined; and the likelihood ratio (LR) is determined when N is 1. The polar code SC decoding-based partial sum method of the invention is applied to the partial sum filed of SC decoding.
Description
technical field [0001] The present invention relates to parts and methods, in particular to a part and method based on polar code SC decoding. Background technique [0002] Polar codes (PolarCodes) is a very low-complexity construction code, its encoding and decoding have low complexity, and polar codes can be proved to be able to reach under the binary uncorrelated memoryless channel A code of the Shannon limit. Therefore, in recent years, more and more people have become interested in polar codes and paid great attention to them. The construction of polar codes needs to be completed on the premise of channel polarization. There are different polarization methods for different channels. The encoding process uses a matrix to represent the process of channel polarization combination and decomposition, and the decoding process is an iterative process. The purpose of polar codes is also to improve the reliability of communication, but polar codes are different from other chann...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More