Improved decoding of staircase codes: the soft-aided bit-marking (SABM) algorithm

Yi Lei; Bin Chen; Gabriele Liga; Xiong Deng; Zizeng Cao; Jianqiang Li; Kun Xu; Alex Alvarado

doi:10.1109/TCOMM.2019.2945317

Improved decoding of staircase codes: the soft-aided bit-marking (SABM) algorithm

Yi Lei (Corresponding author)
, Bin Chen
, Gabriele Liga
, Xiong Deng
, Zizeng Cao
, Jianqiang Li
, Kun Xu
, Alex Alvarado

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

32 Citaten (Scopus)

870 Downloads (Pure)

Samenvatting

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

Originele taal-2	Engels
Artikelnummer	8856224
Pagina's (van-tot)	8220-8232
Aantal pagina's	13
Tijdschrift	IEEE Transactions on Communications
Volume	67
Nummer van het tijdschrift	12
DOI's	https://doi.org/10.1109/TCOMM.2019.2945317
Status	Gepubliceerd - dec. 2019

Financiering

Manuscript received February 18, 2019; revised July 25, 2019; accepted September 24, 2019. Date of publication October 3, 2019; date of current version December 17, 2019. This work is in part supported by the NSFC Program (No. 61431003, 61821001, 61625104, and 61701155), and the Fundamental Research Funds for the Central Universities (JZ2019HGBZ0126, JZ2019HGBZ0130, PA2019GDZC0098). The work of A. Alvarado and G. Liga is supported by the Netherlands Organisation for Scientific Research (NWO) via the VIDI Grant ICONIC (project number 15685) and has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 57791). This article was presented in part at the International Symposium on Turbo Codes & Iterative Information Processing 2018, Hong Kong, China, December 2018. The associate editor coordinating the review of this article and approving it for publication was A. Graell I Amat. (Corresponding author: Yi Lei.) Y. Lei was with the State Key Laboratory of Information of Photonics and Optical Communications, Beijing University of Posts and Telecommunications (BUPT), Beijing 100876, China. She is now with the School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China (e-mail: [email protected]).

Toegang tot document

10.1109/TCOMM.2019.2945317

publishers versionDefinitieve gepubliceerde versie, 2,03 MBLicentie: TAVERNE

Andere bestanden en links

Link to publication in Scopus

Citeer dit

@article{69f71ae3789d45df90ebbdb29c2a141c,

title = "Improved decoding of staircase codes: the soft-aided bit-marking (SABM) algorithm",

abstract = "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",

keywords = "iterative bounded distance decoding, marked bits, Optical communication systems, product codes, staircase codes",

author = "Yi Lei and Bin Chen and Gabriele Liga and Xiong Deng and Zizeng Cao and Jianqiang Li and Kun Xu and Alex Alvarado",

year = "2019",

month = dec,

doi = "10.1109/TCOMM.2019.2945317",

language = "English",

volume = "67",

pages = "8220--8232",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers",

number = "12",

}

TY - JOUR

T1 - Improved decoding of staircase codes

T2 - the soft-aided bit-marking (SABM) algorithm

AU - Lei, Yi

AU - Chen, Bin

AU - Liga, Gabriele

AU - Deng, Xiong

AU - Cao, Zizeng

AU - Li, Jianqiang

AU - Xu, Kun

AU - Alvarado, Alex

PY - 2019/12

Y1 - 2019/12

N2 - 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

AB - 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

KW - iterative bounded distance decoding

KW - marked bits

KW - Optical communication systems

KW - product codes

KW - staircase codes

UR - https://www.scopus.com/pages/publications/85077081835

U2 - 10.1109/TCOMM.2019.2945317

DO - 10.1109/TCOMM.2019.2945317

M3 - Article

AN - SCOPUS:85077081835

SN - 0090-6778

VL - 67

SP - 8220

EP - 8232

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 12

M1 - 8856224

ER -

Improved decoding of staircase codes: the soft-aided bit-marking (SABM) algorithm

Samenvatting

Financiering

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit