A Soft-Aided Staircase Decoder Using Three-Level Channel Reliabilities
Yi Lei, Bin Chen, Gabriele Liga, Alexios Balatsoukas-Stimming, Kaixuan, Sun, Alex Alvarado

TL;DR
This paper introduces an improved soft-aided staircase decoding algorithm (iSABM) that leverages channel reliabilities to enhance decoding performance of staircase codes with minimal complexity increase.
Contribution
The paper proposes iSABM, an enhanced decoding algorithm for staircase codes that classifies bits using reliability thresholds and enables soft decoding over multiple blocks.
Findings
Up to 0.53 dB gain over SABM at BER of 10^-6.
Up to 0.91 dB gain over standard SCC decoding.
1-bit reliability marking causes minimal performance loss with reduced memory.
Abstract
The soft-aided bit-marking (SABM) algorithm is based on the idea of marking bits as highly reliable bits (HRBs), highly unreliable bits (HUBs), and uncertain bits to improve the performance of hard-decision (HD) decoders. The HRBs and HUBs are used to assist the HD decoders to prevent miscorrections and to decode those originally uncorrectable cases via bit flipping (BF), respectively. In this paper, an improved SABM algorithm (called iSABM) is proposed for staircase codes (SCCs). Similar to the SABM, iSABM marks bits with the help of channel reliabilities, i.e., using the absolute values of the log-likelihood ratios. The improvements offered by iSABM include: (i) HUBs being classified using a reliability threshold, (ii) BF randomly selecting HUBs, and (iii) soft-aided decoding over multiple SCC blocks. The decoding complexity of iSABM is comparable of that of SABM. This is due to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
