Lowered-complexity soft decoding of generalized LDPC codes over AWGN channels

Abstract

This paper presents a lowered complexity version of a reliability-based iterative decoding algorithm for Generalized Low Density Parity Check (GLDPC) codes with BCH constituent codes using Soft-Input Soft-Output (SISO) Chase-II algorithm. Applied to Gallager-based global LDPC code, it shows that the proposed algorithm, when employed on GLDPC with the multi-error correction BCH subcodes, reduces the complexity of the conventional Soft-Decision Decoding (SDD) with Chase algorithm at a cost of slight degradation in the error performance. The approach is built on eliminating the employment of the Chase SISO decoder at the Generalized Check Nodes (GCNs) where the expected number of errors is within the correction capability of the Hard-Decision Decoder (HDD). As a case study, the decoder is considered under AWGN channel and Simulation results are presented showing the complexity and performance of the conventional and proposed algorithms.