Protograph-Based LDPC Codes with Local Irregularity

TL;DR

This paper introduces a new class of protograph-based LDPC codes with local irregularity, improving decoding thresholds and performance for communication systems.

Contribution

It proposes a novel LDPC code family with local irregularity and adapts the PEXIT algorithm for threshold estimation and optimization.

Findings

Reduced iterative decoding thresholds

Improved error correction performance

Effective local irregularity optimization

Abstract

Forward error correcting (FEC) codes are used in many communication standards with a wide range of re quirements. FEC codes should work close to capacity, achieve low error floors, and have low decoding complexity. In this paper, we propose a novel category of low-density parity-check (LDPC) codes, based on protograph codes with local irregularity. This new code family generalizes conventional protograph-based LDPC codes and is capable of reducing the iterative decoding threshold of the conventional counterpart. We introduce an adapted version of the protograph extrinsic information transfer (PEXIT) algorithm to estimate decoding thresholds on the binary input additive white Gaussian noise channel, perform optimiza tions on the local irregularity, and simulate the performance of some constructed codes.