Improved Decoding of Staircase Codes: The Soft-Aided Bit-Marking (SABM) Algorithm

Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed algorithm is based on marking certain number of highly reliable...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 67; no. 12; pp. 8220 - 8232
Main Authors: Lei, Yi, Chen, Bin, Liga, Gabriele, Deng, Xiong, Cao, Zizeng, Li, Jianqiang, Xu, Kun, Alvarado, Alex
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed algorithm is based on marking certain number of highly reliable and highly unreliable bits. These marked bits are used to improve the miscorrection-detection capability of the SCC decoder and the error-correcting capability of BDD. For SCCs with 2-error-correcting Bose-Chaudhuri-Hocquenghem component codes, our algorithm improves upon standard SCC decoding by up to 0.30 dB at a bit-error rate (BER) of 10 -7 . The proposed algorithm is shown to achieve almost half of the gain achievable by a genie decoder with this structure. The increased complexity caused by bit marking and additional calls to the component BDD decoder is discussed as well. Our algorithm is also extended (with minor modifications) to product codes. The simulation results show that in this case, the algorithm offers gains of up to 0.5 dB at a BER of 10 -7 .
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2019.2945317