Decoding staircase codes with marked bits

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

16 Citaten (Scopus)
183 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 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.

Originele taal-2Engels
Titel2018 IEEE 10th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Aantal pagina's5
ISBN van elektronische versie9781538670484
DOI's
StatusGepubliceerd - 23 jan. 2019
Evenement10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018 - Hong Kong, China
Duur: 3 dec. 20187 dec. 2018

Congres

Congres10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018
Land/RegioChina
StadHong Kong
Periode3/12/187/12/18

Vingerafdruk

Duik in de onderzoeksthema's van 'Decoding staircase codes with marked bits'. Samen vormen ze een unieke vingerafdruk.

Citeer dit