Polarized code simplifying and decoding method

A polar code and decoding technology, which is applied in the field of simplified decoding of polar codes, can solve the problems of increased computational complexity of decoding, reduced search width, and low actual complexity.

Active Publication Date: 2016-06-29
HARBIN INST OF TECH SHENZHEN GRADUATE SCHOOL
View PDF3 Cites 42 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In order to improve the decoding performance of polar codes, based on the original SC decoding method, Tal et al. proposed a sequential SC decoding (SCL), which improves the bit error performance, especially with the assistance of the CRC method, the SCL decoding The bit error performance of can exceed the maximum likelihood decoding, but at the same time, the computational complexity of decoding is also increased to O(lNlogN), l is the search width
Niu et al. proposed a SC decoding (SCS) with a stack stru

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
  • Polarized code simplifying and decoding method
  • Polarized code simplifying and decoding method
  • Polarized code simplifying and decoding method

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0037] Example 1:

[0038] This example provides a simplified decoding method for polarization codes, including the following steps:

[0039] Step S1, establishing a tree graph model for the received polarization code;

[0040] Step S2, dividing each node in the tree graph into information nodes, fixed value nodes and mixed nodes;

[0041] Step S3, pruning the tree graph, pruning the subtree between the fixed value node and the information node, and leaving the fixed value node and the information node connected to the mixed node;

[0042] Step S4: Perform a recursive decoding operation on the pruned decoding tree in order from the root node. In step S1 in this example, the polarization code is (N, K, A, u A c ) Code; the simplified decoding method of the polarization code is also called the simplified method of SC decoding based on tree graph pruning.

[0043] Channel polarization is to combine and separate N binary discrete memoryless channels, so that the channel capacity of some cha...

Example Embodiment

[0065] Example 2:

[0066] On the basis of embodiment 1, the difference from embodiment 1 is that this example mainly adopts the BP decoding simplification method based on tree graph pruning, and the BP decoding simplification method based on tree graph pruning is also described Simplified decoding method of polarization codes Among them, the modeling and analysis of BP decoding are as follows.

[0067] use figure 1 The tree graph model analyzes the polarization code BP decoding algorithm. Node v in the i-th layer i ,i∈1,...,n corresponds to the decoding calculation: node v i By receiving the soft information transmitted by the i-1 layer, the log likelihood ratio α i,v , Calculate and send to its left child node v at the i+1th layer i+1,l And right child node v i+1,r Soft information transmitted α i+1,l And soft information α i+1,r for Node v i By receiving the soft information β transmitted by the i+1 layer i+1,l , Β i+1,r , Calculate and report to its parent node v at the i-1t...

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

No PUM Login to view more

Abstract

The invention provides a polarized code simplifying and decoding method.The polarized code simplifying and decoding method includes the following steps that step S1, a tree graph model is established for received polarized codes; step S2, nodes in a tree graph are divided into information nodes, fixed value nodes and mixed nodes; step S3, the tree graph is pruned, sub-trees between the fixed value nodes and the information nodes are cut off, and the fixed value nodes and the information nodes connected with the mixed nodes are left; step S4, a decoding tree graph after pruning is subjected to decoding operation.The polarized code simplifying and decoding method can achieve the purposes of reducing decoding complex and improving the decoding efficiency on the premise that the decoding performance is not affected and finally performs simulation verification, and the decoding complexity of SC decoding and BP decoding after simplification are reduced by 36%-65% and 41%-67% respectively compared with an original algorithm.

Description

technical field [0001] The invention relates to a decoding method of polar codes, in particular to a simplified decoding method of polar codes. Background technique [0002] In 2009, Arlkan proposed channel polarization. For binary discrete memoryless channels, through combination and separation, part of the channel capacity tends to 0, and the other part tends to 1, thus forming channel polarization. Polar code is a new type of channel coding based on channel polarization. According to the required code rate, information is encoded in the part corresponding to channel capacity polarized to 1, while other parts are encoded into fixed values, which can be used in binary symmetric channels. close to the Shannon limit. Therefore, since the concept of polar code was proposed, it has attracted great attention internationally. At present, the main research on polar codes focuses on channel selection and decoder design in practical applications. [0003] The original decoding me...

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
no application Login to view more
IPC IPC(8): H03M13/13
CPCH03M13/13H03M13/1191
Inventor 焦健冯博文顾术实吴绍华张钦宇
Owner HARBIN INST OF TECH SHENZHEN GRADUATE SCHOOL
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap