A Polar Code Decoding Method Based on Segmented Hash Sequence

Abstract

The invention relates to a polarization code decoding method, in particular to a polarization code decoding method based on a segmented Hash sequence, and belongs to the field of channel encoding. According to the polarization code decoding method, the Hash sequence is inserted in an information bit sequence in segments, the information bit sequence is checked in segments by using the Hash sequence in a decoding process, and a decoding search path is reduced or the decoding is terminated in advance by using the check result, thereby reducing the decoding complexity and reducing the decoding delay.

Description

technical field [0001] The invention relates to a polar code decoding method, in particular to a polar code decoding method based on a segmented Hash sequence, and belongs to the field of channel coding. Background technique [0002] In 2009, Arikan proposed a polar code encoding and decoding scheme in an article that attracted widespread attention in the channel coding community. This is the first time in the history of channel coding that a coding and decoding scheme that can theoretically achieve channel capacity is given . [0003] The core principle of polar codes is channel polarization theory, and channel polarization is divided into channel combination and channel splitting. Channel combination is to combine N independent channels W:X→Y into a whole channel W through linear transformation. N :X N →Y N , as attached figure 1 As shown in the figure, the schematic diagrams of combining two channels and realizing channel combination of N channels through recursion a...

AI Technical Summary

Problems solved by technology

[0004] Although the SCL decoding algorithm has performance close to Maximum Likelihood (ML), it still has two disadvantages: (1) The high decoding reliability of the SCL algorithm is at the cost of increased complexity, and its decoding The complexity increases with the increase of the search path L; (2) The polar code decoding algorithm is sequential decoding, and there is a certain error propagation phenomenon, that is, if the first few bits are decoded incorrectly, the following bits will be decoded Failed, but in the existing CA-SCL algorithm, the check digit is after the information bit, and the check can only be performed after all the bits are decoded

Images