A Simplified Decoding Method of Polar Codes

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...

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 structure. Its bit error performance is also improved compared with the original SC decoding, but its computational complexity is also increased to O(lNlogN), l is the search width, In the actual algorithm execution, the search width will be reduced under high signal-to-noise ratio, making the actual complexity of SCS decoding slightly lower than that of SCL decoding

It can be seen that although the polar code can approach the Shannon limit of the channel, the cost is the increase of the decoding complexity

Images