Research On Decoding Performance Of Polar Codes Based On SC Algorithm

Polar codes are channel polarization codes, it has come to be one of the best codingtechnologies because of their low-complexity successive cancellation decodingalgorithm. With a structural method for the first time and based on the channelpolarization phenomenon, the proposer analyzed the progressive performance of coding.Polar codes’ good structure characteristics open up a new direction of the channelcoding technology. Furthermore, there have been many applications based onconcatenated polar coding scheme, such as deep space communications, magneticrecoding channels, and optical transport systems.This paper is mainly to do a study of polar codes’ decoding algorithm for the BECand AWGN channel, and the scheme of polar codes concatenated with LDPC codes.Some results are obtained and summarized as follow:1. An overview of the basis structure of polar codes and the basis theory of itsgraph model. The cause of channel polarization phenomenon and the rate ofchannel-capacity’ convergence are analyzed in detail.2. The basic principle of successive cancellation decoding algorithm is thoroughlyanalyzed. Simulations of polar codes based on successive cancellation decodingalgorithm over the BEC and AWGN channels are given, and the simulation results overthe channel show that the code length is longer, the decoding performance is better.3. Concatenated polar codes can be used to improve the polar codes’ decodingperformance. The combination of polar coding with another coding scheme couldeliminate shortcomings of both, and so provide a powerful coding paradigm. In thispaper, the detailed scheme of polar-LDPC is given, and the simulation results show thatthis combination can improve the decoding performance.