Using a numerical approach, tradeoffs between code rate and decoding complexity are studied for long-block-length irregular low-density parity-check codes decoded using the sum-product algorithm under the usual parallel-update messagepassing schedule. The channel is an additive white Gaussian noise channel and the modulation format is binary antipodal signalling, although the methodology can be...

A high-throughput memory-efficient decoder architecture for archit~ E ~ U ~ O B W B I ~ low-density parity-check (LDPC) codes is proposed based on a novel turbo-decoding algorithm. The aichltecture benefits from various optimizations at the code-design, decoding algorithm, and decoder architecture levels. The interconnect complexity and memory overhead problems of current decoder implementation...

Multi-Edge type Low-Density Parity-Check codes (METLDPC codes) introduced by Richardson and Urbanke are generalized LDPC codes which can be seen as LDPC codes obtained by concatenating several standard (ir)regular LDPC codes. We prove in this paper that MET-LDPC code ensembles possess a certain symmetry with respect to their Average Coset Weight Distributions (ACWD). Using this symmetry, we dri...

Absorbing sets are combinatorial structures in the Tanner graphs of low-density parity-check (LDPC) codes that have been shown to inhibit high signal-to-noise ratio performance iterative decoders over many communication channels. minimum size most likely cause errors, and thus focus much research. In this paper, we determine sizes absorbing can occur general left-regular LDPC code graphs, with ...