Research On The Encoding And Decoding Algorithm Of Polar Codes In URLLC

With the evolution of wireless communication standard protocols,the channel coding technology has also undergone many changes.In the past decade,polar codes have received widespread attention because of their theoretically capacity reachability.With channel combination and channel splitting operations,multiple parallel channels are transformed into corresponding polarized sub-channels,and the channel capacity of these sub-channels naturally approaches 0 or 1.At the same time,the coding and decoding complexity of polarized codes is very low,which is conducive to its application in the industrial sector.Therefore,based on this,the related researches on the construction algorithm of the polar code,the high-reliability and low-delay decoding algorithm of the polar code,and the search decoding algorithm of the polar code are summarized as follows:This paper proposes a polar code construction algorithm based on linear independence.Aiming at the encoding matrix of the polar code,this paper analyzes the relationship between the generation matrix and the check matrix of the polar code,and proposes a method for optimizing the weight spectrum of the polar code,that is,constructing the polar code based on linear independence.At the same time,this article analyzes the source of decoding errors under OSD decoding and SCL decoding,and constructs polar codes under corresponding decoding algorithms.Especially for SCL decoding algorithms,multiple decoding paths add information bits.Therefore,the theoretical capacity can be increased,so the weight spectrum can be optimized under the new number of information bits,thereby improving the SCL decoding performance.Simulations show that the linear code-independent polarization code construction algorithm can optimize the weight spectrum.Under the OSD and SCL decoding algorithms,the construction algorithm proposed in this paper also has obvious advantages.This paper proposes a BP-List decoding algorithm based on bit splitting.Aiming at the current delay and reliability requirements of polar code decoding,a new bit-splitting-based BPList algorithm is designed in this paper.This algorithm uses the low-latency characteristics of the BP algorithm in the BP decoding framework.The process unit is modified into a new one,through the modified process element,the information in the process of BP iteration changed from absolute information to conditional information,and the bit splitting process can be well implemented,and the path metric can be effectively used for path deletion.Later in this article,we introduced the concept of critical set,because non-critical sets are generally not the first place where errors occur,so we only perform bit splitting operations on critical sets,and at the same time significantly reduce the number of iterations by designing appropriate termination conditions.Simulation results show that the BP-List decoding algorithm based on bit splitting proposed in this paper is slightly better than the traditional CA-SCL decoding algorithm in bit error performance.At the same time,the algorithm is better than CA-SCL in decoding delay.It is better than state of the art low-latency algorithm,such as Fast-SCL.Finally,this paper proposes a BP-MSD decoding algorithm.Aiming at the future short packet communication scenarios,this paper studies the reliable decoding algorithm of polar codes under short packets.This paper introduces the LDPC concatenated polar code to implement a hybrid decoding algorithm of BP decoding and mask search decoding.The algorithm first performs a joint BP iterative decoding,and uses the check characteristics of the LDPC concatenated polar code to determine whether the decoding is successful.If the decoding fails,perform a mask search decoding.The mask search decoding utilizes the reliability of the received information,and searches only in a part of the space.At the same time,the mask is used to determine the specific search space.Simulations show that this method is better than the OSD-3 decoding algorithm in terms of bit error performance.At the same time,the algorithm requires fewer searches.Because it is a BP hybrid decoding,the algorithm also has a good delay.The advantages.