Name
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
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-7</sup>
. The proposed algorithm is shown to achieve almost half of the gain achievable by an idealized decoder with this structure. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ISTC.2018.8625340 | 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC) |
Keywords | Field | DocType |
BDD,SCC decoding,staircase codes,bit-error rate,2-error-correcting BCH component codes,SCC decoder,miscorrection-detection capability,soft information,iterative bounded-distance decoding,noise figure 0.3 dB | Soft information,Computer science,Algorithm,Communication channel,BCH code,Decoding methods | Conference |
ISSN | ISBN | Citations |
2165-4700 | 978-1-5386-7049-1 | 3 |
PageRank | References | Authors |
0.53 | 1 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Lei | 1 | 3 | 0.87 |
| Alex Alvarado | 2 | 110 | 27.09 |
| Bin Chen | 3 | 4 | 2.57 |
| Xiong Deng | 4 | 27 | 9.29 |
| Zizheng Cao | 5 | 12 | 7.43 |
| Jianqiang Li | 6 | 5 | 2.93 |
| kun xu | 7 | 203 | 20.29 |