A new method is presented for low-complexity near-maximum-likelihood (ML) decoding of low-density parity-check (LDPC) codes over the additive white Gaussian noise channel. The proposed method termed ...

Dynamic scheduling and decoding algorithms have become pivotal in advancing the performance of error-correcting codes. Recent innovations have focused on refining Low-Density Parity-Check (LDPC ...

Low-density parity-check (LDPC) codes deliver very good performance when decoded with the BP algorithm. Unfortunately, this algorithm has the disadvantage to be complex for implementation. In this ...

A new technique for efficient encoding of LDPC codes based on the known concept of Approximate Lower Triangulation (ALT) is introduced. The greedy permutation algorithm is presented to transform ...

ABSTRACT: In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The ...

The Progressive Edge-Growth (PEG) algorithm for generating Tanner graphs (parity check matrices) for LDPC codes. Its main goal is to avoid short cycles in the graph, which improves performance under ...