Untainted Puncturing for Irregular Low-Density Parity-Check Codes

TL;DR

This paper introduces a novel puncturing algorithm for irregular low-density parity-check codes that improves performance by focusing on untainted symbols, enhancing rate compatibility.

Contribution

The paper proposes a new intentional puncturing algorithm based on untainted symbols, outperforming previous methods for various coding rates and puncture proportions.

Findings

Better performance than previous puncturing methods

Effective for a range of coding rates

Improves rate compatibility in LDPC codes

Abstract

Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.