Deep-Learning for Breaking the Trapping Sets in Low-Density Parity-Check Codes

In the low-error rate regime, message-passing (MP) decoding for low-density parity-check (LDPC) codes is known to have performance degradation due to trapping sets (TSs), which often limits the use of LDPC codes for applications with low target error rates like storage devices. This work proposes a novel deep-learning based decoding algorithm which is tailored for breaking TSs. In particular, when MP decoding fails due to TSs, there exist pairs of unsatisfied check nodes (CNs) which are connected through paths only with error variable nodes (VNs), i.e., VNs with erroneous hard-decision results. The proposed algorithm efficiently identifies the paths with error VNs between unsatisfied CNs with the aid of deep-learning techniques. Then, the decoding failures are resolved by repeating the MP decoding after re-initializing the channel outputs for the error VNs in the identified paths. In addition, by analyzing the behaviors of the deep-learning based algorithm, we propose a low-complexity algorithm, called adaptive-error-path (AEP) detector. Simulation results show that the proposed algorithms efficiently break the TSs and significantly improve the error-floor performance in the low error-rate regime.

Automated summary

The paper proposes a deep-learning based decoding algorithm tailored for breaking trapping sets in LDPC codes. By re-initializing the channel outputs for error variable nodes, the decoding failures are resolved, significantly improving the performance in the low error-rate regime.