Polar Code Encoding Method of Segmented Concatenated Hash Sequence

Abstract

The invention discloses a polar code encoding method, especially relates to a polar code encoding method of a sectional-cascaded Hash sequence, and belongs to the field of the channel encoding. The encoding method comprises the following steps: performing Hash check on information bit sequence sections, and orderly cascading the information bit sequences with checked bit sequences to construct a new bit sequence to perform the polar code encoding. The core of the method is that the check accuracy is improved by using the independent random feature of the Hash sequence, the probability of generating the same check bit by different information is lowered; and meanwhile, the sectional checking method not only can be used for checking the information bit, but also can be used for checking the former check bit.

Description

technical field [0001] The invention relates to a polar code encoding method, in particular to a polar code encoding method of segmented concatenated Hash sequences, and belongs to the field of channel encoding. 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 rec...

AI Technical Summary

Problems solved by technology

[0004] Although CRC-aided polar codes have the advantages of high reliability and low encoding and decoding complexity, there are still two disadvantages in the existing schemes: (1) Using the method of cyclic redundancy check, different information sequences may generate the same parity bit

That is, when the information sequence is wrong, there is still a certain probability that it will be judged as correct decoding through the CRC check; (2) In the existing scheme, the CRC check bit only checks the information bits before the check bit, and cannot check the information bits between The check digit is checked, if the previous check digit is wrong, it cannot be detected in the next check

Images