期刊
IEEE COMMUNICATIONS LETTERS
卷 24, 期 2, 页码 254-258出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2019.2955450
关键词
Vegetation; Forestry; Parity check codes; Complexity theory; Decoding; Floors; Indexes; Spatially coupled low-density parity-check (SC-LDPC) codes; constraint length; trapping sets; error floor
资金
- Ontario Trillium Scholarship
- NSERC [RGPIN-2019-06401]
In this letter, we design time-invariant spatially coupled low-density parity-check (SC-LDPC) codes with small constraint length and low error floor. For this, we modify the codes in the literature that have (close to) minimal constraint length for a given degree distribution and girth, to improve their error floor. This is performed by eliminating (or minimizing the multiplicity of) some of the dominant trapping sets (TSs) of the codes and/or increasing the minimum distance. To reduce the multiplicity of the TSs effectively and efficiently, we devise a technique based on the parent/child relationship between TSs that aims at successively minimizing the multiplicity of TSs depending on their harmfulness.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据