In this paper, we investigate the weighted iterative decoding to improve the performance of turbo-polar code. First of all, a minimum weighted mean square error criterion is proposed to optimize the scaling factors(SF...In this paper, we investigate the weighted iterative decoding to improve the performance of turbo-polar code. First of all, a minimum weighted mean square error criterion is proposed to optimize the scaling factors(SFs). Secondly, for two typical iterative algorithms,such as soft cancellation(SCAN) and belief propagation(BP) decoding, genie-aided decoders are proposed as the ideal reference of the practical decoding. Guided by this optimization framework, the optimal SFs of SCAN or BP decoders are obtained. The bit error rate performance of turbo-polar code with the optimal SFs can achieve 0.3 dB or 0.7 dB performance gains over the standard SCAN or BP decoding respectively.展开更多
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 ba...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.展开更多
In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are de...In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).展开更多
基金supported by the National Natural Science Foundation of China(No.61671080)the National Natural Science Foundation of China(No.61771066)Nokia Beijing Bell Lab
文摘In this paper, we investigate the weighted iterative decoding to improve the performance of turbo-polar code. First of all, a minimum weighted mean square error criterion is proposed to optimize the scaling factors(SFs). Secondly, for two typical iterative algorithms,such as soft cancellation(SCAN) and belief propagation(BP) decoding, genie-aided decoders are proposed as the ideal reference of the practical decoding. Guided by this optimization framework, the optimal SFs of SCAN or BP decoders are obtained. The bit error rate performance of turbo-polar code with the optimal SFs can achieve 0.3 dB or 0.7 dB performance gains over the standard SCAN or BP decoding respectively.
基金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.
基金the National Natural Science Foundation of China(Nos.61401164,61471131 and 61201145)the Natural Science Foundation of Guangdong Province(No.2014A030310308)
文摘In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).
