A codeword construction method for punctured polar codes

Abstract

The invention discloses a codeword construction method for a punctured Polar code, comprising the steps of: determining coding parameters, setting polarization cores; sorting all split sub-channels according to their channel capacities, and constructing information sequences according to a fixed coding length; Calculate the polarization generator matrix according to the fixed code length and polarization kernel; calculate the initial code sequence according to the information sequence and the polarization generator matrix; select the column a in order of the column weight of each column of the polarization generator matrix, and construct the code according to its index number Word deletion matrix; according to the codeword deletion matrix, the elements at the corresponding positions in the initial coding sequence are respectively indexed and deleted to obtain the final coding sequence. The invention performs codeword deletion according to the correlation degree of the coding mapping, not only has low realization complexity, high application flexibility of Polar codes, but also has better decoding performance, ensures the stability of the communication system, and has broad application prospects.

Description

technical field [0001] The invention belongs to the field of digital communication channel coding, and in particular relates to a codeword construction method for punctured Polar codes. Background technique [0002] Polar code is a coding scheme for communication proposed by Professor E. Arikan in 2009. In theory, it is a coding method that can be proved by rigorous mathematical reasoning to reach the Shannon limit. At the transmitting end, N independent channels are mutually polarized, and the channel capacity of the split sub-channels tends to be 0 or 1. The channel polarization process is as follows: figure 1 As shown, it includes two processes of channel combining and channel splitting. When the code length tends to infinity, a part of the channel becomes a pure noise channel, and the other part becomes a noiseless channel. The ratio of split sub-channels with a channel capacity of 0 or 1 after polarization to the total channel varies with the code length as follows: ...

AI Technical Summary

Problems solved by technology

[0003] Since the traditional polar code is constructed based on the Kronecker power of the Arikan kernel, the code length of the polar code is limited to 2 n (n is a positive integer), and in the actual communication system we know that the length of the original information is often uncertain, so the encoding can be adjusted according to the length of the original information is a problem we must consider, although using other polarization For example, the BCH code core can achieve the purpose of constructing other code lengths, but the code length is still limited by the power of the core length, and the Polar code decoding structure constructed by this method is more complicated; some codeword deletion algorithms currently exist Although Polar codes of any length can be constructed, the considerations are not sufficient when deleting codewords, and the performance of the constructed Polar codes is poor, which damages the performance of the communication system.

Images