Error-and-Erasure Decoding of Product and Staircase Codes

被引:8
作者
Rapp, Lukas [1 ]
Schmalen, Laurent [1 ]
机构
[1] Karlsruhe Inst Technol KIT, Commun Engn Lab CEL, D-76187 Karlsruhe, Germany
基金
欧洲研究理事会;
关键词
Codes; Decoding; Message passing; Iterative decoding; Complexity theory; Product codes; Encoding; Channel coding; product codes; iterative decoding; CAPACITY;
D O I
10.1109/TCOMM.2021.3118789
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
High-rate product codes (PCs) and staircase codes (SCs) are ubiquitous codes in high-speed optical communication achieving near-capacity performance on the binary symmetric channel. Their success is mostly due to very efficient iterative decoding algorithms that require very little complexity. In this paper, we extend the density evolution (DE) analysis for PCs and SCs to a channel with ternary output and ternary message passing, where the third symbol marks an erasure. We investigate the performance of a standard error-and-erasure decoder and of its simplification using DE. The proposed analysis can be used to find component code configurations and quantizer levels for the channel output. We also show how the use of even-weight BCH subcodes as component codes can improve the decoding performance at high rates. The DE results are verified by Monte-Carlo simulations, which show that additional coding gains of up to 0.6dB are possible by ternary decoding, at only a small additional increase in complexity compared to traditional binary message passing.
引用
收藏
页码:32 / 44
页数:13
相关论文
共 28 条
[1]   Low-Complexity Concatenated LDPC-Staircase Codes [J].
Barakatain, Masoud ;
Kschischang, Frank R. .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 2018, 36 (12) :2443-2449
[2]  
Blahut R. E, 2003, Algebraic codes for data transmission
[3]   ERROR-FREE CODING [J].
ELIAS, P .
IRE TRANSACTIONS ON INFORMATION THEORY, 1954, (04) :29-37
[4]   GENERALIZED MINIMUM DISTANCE DECODING [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1966, 12 (02) :125-+
[5]  
Graell i Amat A., 2020, SPRINGER HDB OPTICAL, DOI DOI 10.1007/978-3-030-16250-4_7
[6]   Approaching Miscorrection-Free Performance of Product Codes With Anchor Decoding [J].
Hager, Christian ;
Pfister, Henry D. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (07) :2797-2808
[7]   Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates [J].
Hager, Christian ;
Pfister, Henry D. ;
Graell i Amat, Alexandre ;
Brannstrom, Fredrik .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (07) :4357-4378
[8]   Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes [J].
Hou, JL ;
Siegel, PH ;
Milstein, LB ;
Pfister, HD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (09) :2141-2155
[9]   Approaching Capacity at High Rates With Iterative Hard-Decision Decoding [J].
Jian, Yung-Yih ;
Pfister, Henry D. ;
Narayanan, Krishna R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (09) :5752-5773
[10]  
Jian YY, 2013, IEEE GLOB COMM CONF, P2376, DOI 10.1109/GLOCOM.2013.6831429