期刊
IEEE COMMUNICATIONS LETTERS
卷 24, 期 7, 页码 1378-1382出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2020.2985773
关键词
Decoding; Schedules; Prediction algorithms; Convergence; Matrix decomposition; Optimization; Parity check codes; Tail-biting spatially coupled protograph codes; extrinsic information transfer; shuffled decoding
资金
- NSF of China [61771149, 61701121, 61471294, 61871132]
- Open Research Fund of National Mobile Communications Research Laboratory, Southeast University [2018D02]
- NSF of Guangdong Province [2019A1515011465]
- Science and Technology Program of Guangzhou [201904010124]
- Guangdong Province Universities and Colleges Pearl River Scholar Funded Scheme [2017-ZJ022]
- Research Project of the Education Department of Guangdong Province [2017KTSCX060]
- Guangdong Innovative Research Team Program [2014ZT05G157]
In this letter, we conduct a comprehensive investigation on tail-biting (TB) spatially coupled protograph (SC-P) low-density parity-check (LDPC) codes under shuffled belief-propagation (BP) decoding. We first propose a shuffled extrinsic information transfer (S-EXIT) algorithm tailored for the shuffled decoding. Exploiting the proposed algorithm, we accurately predict the convergence performance (i.e., decoding thresholds) for TB-SC-P codes under such a schedule and demonstrate that their convergence performance can be further improved. Based on the S-EXIT analysis, we develop an optimization method to generate a new type of TB-SC-P codes, called improved TB-SC double-protograph (I-TB-SC-DP) codes, which can inherit the superiorities of two mother protograph codes and possess more desirable decoding thresholds. Theoretical analyses and simulated results illustrate that the proposed I-TB-SC-DP codes exhibit better error performance than the existing counterparts.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据