Research On Wireless Communication Channel Coding Based On Polar Codes

The polar code is a code that has been proven to achieve channel capacity when the code length is large enough,and it is a coding scheme for 5G technology.However,when the code length is finite,the error correction performance of the polar code is not ideal.Therefore,various versions of the successive cancellation list decoding algorithm have been proposed Adaptive successive cancellation list decoding algorithm is one of them.This decoding can achieve maximum likelihood decoding performance,but it has two drawbacks.On one hand,the initial value of the search width is always set to 1;on the other hand,when the decoding updates the search width,it may be updated more than once.Thus,high complexity and delay are generated in the case of poor channel quality.Aiming at this problem,considering different code lengths,an optimal successive cancellation list decoding algorithm is designed for smaller code lengths.For larger code lengths,a used-optimal-parameter successive cancellation list decoding is designedThe simulation results of CRC(Cyclic Redundancy Check)-aided successive cancellation list decoding under different search widths and the decoding process of adaptive successive cancellation list decoding are comprehensively analyzed.It is found that the initial value of search width is always fixed at 1 and the search width update scheme is unreasonable.At the same time,it is proposed to solve the above problem by determining the optimal search width In order to determine the optimal search width,considering different code lengths,a dynamic determination scheme using historical data tracking method and a static determination scheme using BP(Back Propagation)neural network tool are proposed.On this basis,combined with the dynamic determination scheme,an optimal successive cancellation list decoding algorithm is designed.A used-optimal-parameter successive cancellation list decoding is designed in combination with the static determination schemeThis thesis simulates an optimal successive cancellation list decoding and a used-optimal-parameter successive cancellation list decoding on the C++platform.The simulation results show that compared with the adaptive successive cancellation list decoding algorithm,both of the new algorithms can guarantee the decoding performance while significantly reducing the average complexity and delay at low SNR.