Projects per year
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.
|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|
|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||10th IEEE International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2018|
|Period||3/12/18 → 7/12/18|
FingerprintDive into the research topics of 'Decoding staircase codes with marked bits'. Together they form a unique fingerprint.
- 2 Active