Decoding staircase codes with marked bits

Y. Lei; Alex Alvarado; B. Chen; X. Deng; Z. Cao; Jianqiang Li; Kun Xu

doi:10.1109/ISTC.2018.8625340

Decoding staircase codes with marked bits

Y. Lei, Alex Alvarado, B. Chen, X. Deng, Z. Cao, Jianqiang Li, Kun Xu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

16 Citations (Scopus)

181 Downloads (Pure)

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 BCH component codes, our algorithm improves upon standard SCC decoding by up to 0.30 dB at a bit-error rate of 10 ^-7 . The proposed algorithm is shown to achieve almost half of the gain achievable by an idealized decoder with this structure.

Original language	English
Title of host publication	2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Number of pages	5
ISBN (Electronic)	9781538670484
DOIs	https://doi.org/10.1109/ISTC.2018.8625340
Publication status	Published - 23 Jan 2019
Event	10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 - Hong Kong, China Duration: 3 Dec 2018 → 7 Dec 2018

Conference

Conference	10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
Country/Territory	China
City	Hong Kong
Period	3/12/18 → 7/12/18

Funding

This work is in part supported by the NSFC Program (No. 61431003, 61601049, 61625104, and 61701155) and Fund of State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications (No. IPOC2017ZT08). The work of A. Alvarado 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). The author Yi Lei would like to thank China Scholarship Council (CSC) for supporting her study in Netherlands.

Access to Document

10.1109/ISTC.2018.8625340

Author VersionFinal author version , 312 KB

Cite this

@inproceedings{4325544de0f34d43809881da2c3ac649,

title = "Decoding staircase codes with marked bits",

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 BCH component codes, our algorithm improves upon standard SCC decoding by up to 0.30 dB at a bit-error rate of 10 -7 . The proposed algorithm is shown to achieve almost half of the gain achievable by an idealized decoder with this structure. ",

author = "Y. Lei and Alex Alvarado and B. Chen and X. Deng and Z. Cao and Jianqiang Li and Kun Xu",

year = "2019",

month = jan,

day = "23",

doi = "10.1109/ISTC.2018.8625340",

language = "English",

booktitle = "2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 ; Conference date: 03-12-2018 Through 07-12-2018",

}

Lei, Y, Alvarado, A , Chen, B, Deng, X, Cao, Z, Li, J & Xu, K 2019, Decoding staircase codes with marked bits. in 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018., 8625340, Institute of Electrical and Electronics Engineers, Piscataway, 10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018, Hong Kong, China, 3/12/18. https://doi.org/10.1109/ISTC.2018.8625340

Decoding staircase codes with marked bits. / Lei, Y.; Alvarado, Alex ; Chen, B. et al.
2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018. Piscataway: Institute of Electrical and Electronics Engineers, 2019. 8625340.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Decoding staircase codes with marked bits

AU - Lei, Y.

AU - Alvarado, Alex

AU - Chen, B.

AU - Deng, X.

AU - Cao, Z.

AU - Li, Jianqiang

AU - Xu, Kun

PY - 2019/1/23

Y1 - 2019/1/23

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 BCH component codes, our algorithm improves upon standard SCC decoding by up to 0.30 dB at a bit-error rate of 10 -7 . The proposed algorithm is shown to achieve almost half of the gain achievable by an idealized decoder with this structure.

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 BCH component codes, our algorithm improves upon standard SCC decoding by up to 0.30 dB at a bit-error rate of 10 -7 . The proposed algorithm is shown to achieve almost half of the gain achievable by an idealized decoder with this structure.

UR - http://www.scopus.com/inward/record.url?scp=85062385571&partnerID=8YFLogxK

U2 - 10.1109/ISTC.2018.8625340

DO - 10.1109/ISTC.2018.8625340

M3 - Conference contribution

AN - SCOPUS:85062385571

BT - 2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018

Y2 - 3 December 2018 through 7 December 2018

ER -

Decoding staircase codes with marked bits

Abstract

Conference

Funding

Access to Document

Other files and links

Fingerprint

FUN-NOTCH: Fundamentals of the Nonlinear Optical Channel

ICONIC: Increasing the Capacity of Optical Nonlinear Interfering Channels

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

Cite this

Decoding staircase codes with marked bits

Abstract

Conference

Funding

Access to Document

Other files and links

Fingerprint

Projects

FUN-NOTCH: Fundamentals of the Nonlinear Optical Channel

ICONIC: Increasing the Capacity of Optical Nonlinear Interfering Channels

Research output

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

Cite this