.png){kind=icon}
.png){kind=icon}
Return
Novel High-Throughput Decoding Algorithms for Product and Staircase Codes Based on Error-and-Erasure Decoding
.png){kind=icon}
OA
AI
DOI：10.1109/JLT.2021.3078172.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance decoding (BDD) of the component codes and iterating between row and column decoders. The performance of iterative BDD (iBDD) can be improved using soft-aided (hybrid) algorithms. Among these, iBDD with combined reliability (iBDD-CR) has been recently proposed for PCs, yielding sizeable performance gains at the expense of a minor increase in complexity compared to iBDD. In this paper, we first extend iBDD-CR to SCCs. We then propose two novel decoding algorithms for PCs and SCCs which improve upon iBDD-CR. The new algorithms use an extra decoding attempt based on error and erasure decoding of the component codes. The proposed algorithms require only the exchange of hard messages between component decoders, making them an attractive solution for ultra high-throughput fiber-optic systems. Simulation results show that our algorithms based on two decoding attempts achieve gains of up to 0.88 dB for both PCs and SCCs. This corresponds to a 33% optical reach enhancement over iBDD with bit-interleaved coded modulation using 256 quadrature amplitude modulation.
Keywords:
Decoding
Iterative decoding
Reliability
Adaptive optics
Table lookup
Forward error correction
Complexity theory
Bounded distance decoding
coded modulation
error and erasure decoding
forward error correction
hard-decision decoding
high-throughput fiber-optic communications
low-density parity-check codes
product codes
staircase codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.7W
Citations:
3.8W
Organization
View more organizations