Design of capacity-approaching irregular low-density parity-check codes

By T. Richardson, Amin Shokrollahi, Rüdiger L. Urbanke. IEEE Transactions on Information Theory, 2001

3,369 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/02746a7981e1e6a8fd252b80e31bf782f5843eec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation (2015, background): “The variable and check node degrees influence the decoding threshold of the LDPC code [73].”
Design of efficiently encodable moderate-length high-rate irregular LDPC codes (2004, methodology): “Following the literature (e.g., [3]), we let and represent the length and dimension, respectively, of an irregular LDPC 0090-6778/04$20.00 © 2004 IEEE code.”
Protograph LDPC Codes Design Based on EXIT Analysis (2007, background): “Consider an LDPCC ensemble Cλ,ρ defined by the degree distribution pair λ(x), ρ(x) [8].”
Probabilistic Constellation Shaping for Optical Fiber Communications (2019, background): “The success of turbo codes led to the rediscovery of lowdensity parity-check (LDPC) codes [9]–[11], which reduced the coding gap to the (modulation-constrained) Shannon limit”
Pointing Error Effects on Free-Space Optical Communication Links in the Presence of Atmospheric Turbulence (2009, background): “For example, when channel fluctuations occur in the order of milliseconds [16], codewords of sufficient lengths, for example, as considered in [17] and [18], can be used to capture multiple fading cycles.”
Outage Capacity Optimization for Free-Space Optical Links With Pointing Errors (2007, background): “Of notable interest is the performance using a hardware-implemented rate-1/2 LDPC code [32].”
Convergence behavior of iteratively decoded parallel concatenated codes (2001, background): “In [4] the authors propose a density evolution algorithm to calculate convergence thresholds for low-density parity-check (LDPC) codes on the additive white Gaussian noise (AWGN) channel; in [5], [6] density evolution is applied to construct LDPC codes with very low thresholds.”
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes (2003, methodology): “In this paper, we explore the use of LDPC codes [10], [ 11 ] as the component codes of both MLC and BICM schemes designed to approach the channel capacity (also cf. [14], [15]).”
High-throughput LDPC decoders (2003, background): “Typically, regular codes are easier to encode and have a simpler decoder architecture than irregular codes, however the latter achieve higher coding gain (e.g., [3], [4] report a rate-0.”
Finite-length analysis of low-density parity-check codes on the binary erasure channel (2002, neutral): “For an introduction into the terminology and basic results of LDPC codes we refer the reader to [3]–[9], [11]–[15].”