Convergence analysis and performance optimization of parallel concatenated systematic polar code  

作　　者：Liu Zhenzhen Niu Kai Dong Chao Lin Jiaru 

机构地区：[1]School of Information and Communication Engineering,Beijing University of Posts and Telecommunications

出　　处：《The Journal of China Universities of Posts and Telecommunications》2018年第2期1-9,共9页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61671080,61771066);the Fundamental Research Funds for the Central Universities(BUPT2015RC06)

摘　　要：Similar to the analysis of Turbo codes, the parallel concatenated systematic polar code （PCSPC） can also be analyzed by the extrinsic information transfer （EXIT） chart. The convergence of the iterative decoding based on soft cancellation （SCAN） and belief propagation （BP） of PCSPC are analyzed by the EXIT chart. Analysis shows that SCAN decoder is more appropriate than BP decoder for this iterative decoding structure in terms of complexity. In addition, the weight coefficients of the iterative decoding structure are optimized by the simulated-EXIT （S- EXIT） chart, which improves the performance of PCSPC.Similar to the analysis of Turbo codes, the parallel concatenated systematic polar code （PCSPC） can also be analyzed by the extrinsic information transfer （EXIT） chart. The convergence of the iterative decoding based on soft cancellation （SCAN） and belief propagation （BP） of PCSPC are analyzed by the EXIT chart. Analysis shows that SCAN decoder is more appropriate than BP decoder for this iterative decoding structure in terms of complexity. In addition, the weight coefficients of the iterative decoding structure are optimized by the simulated-EXIT （S- EXIT） chart, which improves the performance of PCSPC.

关 键 词：PCSPC EXIT chart SCAN decoder BP decoder weight coefficient 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]