Low Complexity Generalized-LDPC Decoder Based on Trellis Splicing

Abstract

The high reliability short length low-density parity-check (LDPC) codes for Ultra Reliable Low Latency Communication (URLLC) are particularly important to future wireless communication systems. Even though the error floor region performance can be improved by using generalized-LDPC (G-LDPC) decoder, its penalty of increasing complexity can not be ignored. In this letter, we invoke the early stop criterion and the trellis splicing (TS) method to G-LDPC decoder. Hence, a G-LDPC-TS decoder is proposed. The proposed method can effectively reduce the number of variable nodes (VNs) involved in BCJR (Bahl-Cocke-Jelinek-Raviv) decoding of G-LDPC; thus, it yields a lower computational complexity. The results confirm that our G-LDPC-TS decoder can achieve a significant complexity reduction without sacrificing the performance.