Maximum Likelihood Erasure Decoding of LDPC Codes: Pivoting Algorithms and Code Design

Abstract

This paper investigates efficient maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over erasure channels. A set of algorithms, referred to as pivoting algorithms, is developed. The aim is to limit the average number of pivots (or reference variables) from which all the other erased symbols are recovered iteratively. The suggested algorithms exhibit different trade-offs between complexity of the pivoting phase and average number of pivots. Moreover, a systematic procedure to design LDPC code ensembles for efficient ML decoding is proposed. Numerical results illustrate that the designed LDPC codes achieve a near-optimum performance (very close to the Singleton bound, at least down to a codeword error rate level 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-8</sup> ) with an affordable decoding complexity. For one of the presented codes and algorithms, a software implementation has been developed which is capable to provide data rates above 1.5 Gbps on a commercial computing platform.