Optimization And Simulation Of Polar Code Coding And Decoding Algorithm

After Shannon put forward the theory of channel coding in 1948,relevant scholars conducted active exploration in order to make the channel transmission rate reach the Shannon limit proposed by this theory.Some coding schemes,such as LDPC codes and Turbo codes,have shown excellent performance with only a 0.1 dB gap from Shannon limits.Erdal Arian proposed the polar code in 2009,which has been theoretically proved to be able to reach the Shannon limit,arousing the concern of the scholars in the field of channel coding.Due to its excellent performance,polar code shows a broad application prospects.The polar code can show good performance under the condition of long code bits.However,the decoding performance is not ideal in the case of short code bits.Under such circumstance,the polar code decoding performance must be optimized.In this paper,we study the code performance of the polar code,and focus on its decoding performance.The main work of this paper is as follows:1.For channel polarization,this thesis analyzes the process of channel bonding and splitting.On this basis,we further elaborate the principle of encoding the polar code and give the derivation of the generator matrix and the criterion of channel reliability estimation.The principle of the SC decoding algorithm and the BP decoding algorithm of the polar code is summarized.2.The SC algorithm is analyzed in detail,and the lack of decoding is pointed out.Based on the analysis of frozen bits,the delay of the decoding algorithm can be effectively reduced by improving the information bits selection scheme.3.The advantages of the Polar-LDPC cascade scheme are analyzed,the feasibility of the scheme is pointed out,and the principle of improving the performance of the polar code decoding is described.Based on the proposed cascade structure,the algorithm steps are given,and the effectiveness of the scheme is verified by software simulation.