期刊
IEEE TRANSACTIONS ON COMMUNICATIONS
卷 68, 期 8, 页码 4661-4672出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2020.2994612
关键词
Encoding; Maximum likelihood decoding; Iterative decoding; Complexity theory; Convolutional codes; Markov processes; Block Markov superposition transmission (BMST); block-oriented convolutional code; SC-LDPC codes; spatial-coupling
资金
- NSF of China [61871201, 61971454, 61941106, 61772234]
- Guangdong Provincial NSF [2017A030313371, 2016A030308008]
- Science and Technology Planning Project of Guangdong Province [2018B010114001]
- Open Research Fund of Key Laboratory of Space Utilization, Chinese Academy of Sciences [LSU-KFJJ-2019-04]
In this paper, we introduce a novel method, called doubly-recursive block Markov superposition transmission (DrBMST), to construct high-performance spatially coupled codes. An important characteristic of DrBMST codes is that the degrees of the constraint nodes in their normal graphs are at most three. As a result, DrBMST codes can be decoded with low complexity. We first prove that the error probability of an enlarged DrBMST code ensemble can be made arbitrarily small under windowed maximum-likelihood decoding (MLD) by increasing the decoding window size. This result partially explains the superior performances of DrBMST codes. Then we propose to use the extrinsic information transfer (EXIT) chart analysis to estimate the iterative windowed decoding thresholds of DrBMST codes. The EXIT chart analyses show that, with such a simple structure, DrBMST codes are comparable to BMST codes with large encoding memories in terms of decoding thresholds. Finally, we carry out comparisons to validate the advantages of DrBMST codes in terms of error performances and decoding complexities. In particular, for a decoding latency of 20,000 bits, the DrBMST code performs better than the (4, 8)-regular spatially coupled low-density parity-check (SC-LDPC) code, but with lower computational complexity. Hence, DrBMST codes can be used in communication systems with limited computational resources. In addition, we show that DrBMST can be used to construct multiple-rate codes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据