Abstract

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.

Multiple component codes based generalized LDPC codes for high-speed optical transport

Ivan B. Djordjevic and Ting Wang
Opt. Express 22(14) 16694-16705 (2014)

Low-complexity LDPC decoding algorithms for ultra-high-order modulated signals

Hongjun Zhu, Meiyu Fu, Chen Hou, and Guijun Hu
Opt. Express 31(25) 41645-41657 (2023)

Random-iteration algorithm-based optical parallel architecture for fractal-image decoding by use of iterated-function system codes

Hsuan T. Chang and Chung J. Kuo
Appl. Opt. 37(8) 1310-1318 (1998)

FPGA-based burst-error performance analysis and optimization of regular and irregular SD-LDPC codes for 50G-PON and beyond

Mingwei Yang, Ziwen Pan, and Ivan B. Djordjevic
Opt. Express 31(6) 10936-10946 (2023)

Optimized LNS-FAID of LDPC codes: a hybrid precision decoding approach for 50G-PON

Yanchen Lyu, Ming Jiang, Mingyang Zhu, Xinyu Zhong, and Chunming Zhao
Opt. Lett. 49(7) 1700-1703 (2024)