Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A polar code and decoding technology, applied in the field of communication, can solve the problems of unrealistic application and performance difference of BPList algorithm.
Active Publication Date: 2020-04-14
BEIHANG UNIV
View PDF2 Cites 4 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
Although the performance of the BP List algorithm has been improved now, compared with the CA-SCL algorithm, on the one hand, the performance of the BP List algorithm still has a large performance difference. achieved, which is obviously impractical for practical applications
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
Embodiment 1
[0040] Embodiment 1 (i.e. Algorithm 1):
[0041] Code length N=8, factor graph set size |Z|=4, the implementation process is as follows figure 1 shown;
[0042] Step 11: Construct factor graph set Z, |Z|=4, Z={z 1 ,z 2 ,z 3 ,z 4}, channel receiving information S={s 1 ,s 2 ,s 3 ,s 4 ,s 5 ,s 6 ,s 7 ,s 8}, BP decoding information initialization, L 3,i =s i , L j,i = 0, j = {0, 1, 2}, i = {1, 2, 3, 4, 5, 6, 7, 8}, R k,i = 0, k = {0, 1, 2, 3}, R 0,t =∞, t∈F, F is a frozen set.
[0043] Step 12: Choose factor graph z 1 Perform BP iterative decoding, and end if the decoding is correct;
[0044] Step 13: For factor graph z 1 , when the maximum number of iterations is reached, the decoding still fails;
[0045] Step 14: According to the decoding result after decoding, select the two most unreliable positions and the update symbols of the corresponding positions, that is, select |L 3,i +R 3,i |, i={1,2,...,8}, the two smallest positions are taken as unreliable po...
Embodiment 2
[0050] Embodiment 2 (ie algorithm two)
[0051] Code length N=8, factor graph set size |Z|=4; degree of parallelism P=2; the implementation process is as follows Figure 7 shown.
[0052] Step 21: Construct a factor graph set Z, |Z|=4, Z={z 1 ,z 2 ,z 3 ,z 4}, channel receiving information S={s 1 ,s 2 ,s 3 ,s 4 ,s 5 ,s 6 ,s 7 ,s 8}, the initialization is the same as in Algorithm Embodiment 1;
[0053] Step 22: Select factor graph z 1 ,z 2 Perform BP iterative decoding, L 3,i =s i , if only one of the two decodings can be decoded correctly, then end;
[0054] Step 23: If both decoding fails, according to the decoding results, select the corresponding unreliable positions and corresponding symbols respectively, assuming z 1 The corresponding unreliable positions are 2 and 4, and the corresponding symbols are -, +, z 2 The corresponding unreliable positions are 2 and 5, and the corresponding symbols are +, +;
[0055] Step 24: Then for P 1 To decode, use the f...
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 discloses an improved polar code BP List decoding method which comprises the following steps: 1, selecting a factor graph set according to a factor graph error probability method; 2, selecting one factor graph from the factor graph set Z in sequence to perform BP decoding; 3, if the decoding is correct, ending the decoding; otherwise, executing the step 4; 4, if the factor graph is the last factor graph, determining that the decoding fails, and ending the decoding; otherwise, executing the step 5; 5, selecting two positions with the lowest reliability in the x end according to adecoding result in the current factor graph, namely selecting an unreliable position; 6, selecting an unreliable position symbol; and 7, updating the channel initial information, and then turning to the step 2 for execution. According to the method, the performance of BP decoding is close to the performance of CASCL8, the requirement of engineering application is met, meanwhile, the time delay ofthe algorithm can be effectively reduced through parallelization, and the time delay requirement is met.
Description
technical field [0001] The invention relates to a high-performance and low-complexity BP List decoding method, in particular to an improved polar code BP List decoding method, which belongs to the technical field of communication. Background technique [0002] As a kind of main decoding algorithm of polar codes, BP algorithm has been extensively studied. There are two key advantages: (1) The BP decoding algorithm can be implemented in parallel, which overcomes the long delay caused by the serial decoding of the polar code SC decoding algorithm, and can be used as a low-delay decoding algorithm. (2) The BP decoding algorithm can output soft information and can be used in conjunction with iterative receivers. However, the current BP decoding algorithm for polar codes has a key deficiency, which is that the decoding performance is relatively poor. The performance of the BP decoding algorithm can only be compared with that of the SC algorithm, which limits its practical applica...
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