Efficient implementations of the sum-product algorithm for decoding LDPC codes

By Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold, Ajay Dholakia. GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001

388 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/b5ae151eff14f234b2ed8c6edc54ecf7e7b279c2

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

1. Christopher R. Jones
2. S. Dolinar
3. Dariush Divsalar
4. Kenneth S. Andrews
5. Xiao-Yu Hu
6. Evangelos Eleftheriou
7. Dieter-Michael Arnold
8. Naresh R Shanbhag

In Electrical and Electronic Engineering

1. Christopher R. Jones
2. S. Dolinar
3. Dariush Divsalar
4. Kenneth S. Andrews
5. Evangelos Eleftheriou
6. Xiao-Yu Hu
7. Dieter-Michael Arnold
8. Naresh R Shanbhag

Citations in the corpus

• Regular and irregular progressive edge-growth tanner graphs (2005, methodology): “Note that the computational load can be greatly reduced by means of efficient implementations of the sum–product algorithm for decoding LDPC codes [50, 51].”
• High-throughput LDPC decoders (2003, background): “Related ideas were independently proposed in [6], [18].”
• Log-domain decoding of LDPC codes over GF(q) (2004, methodology): “Additions in the SPA are replaced by the Jacobi logarithm [9] which can be approximated by a very simple function, resulting in the max-log-SPA.”
• Capacity-approaching protograph codes (2009, methodology): “This simple-to-prove result is somewhat obscure in the LDPC coding literature, but it has been long noted (e.g., by Mackay [41] or by Hu et al [ 42 ]) that the complexity of calculating dc unique extrinsics using the BCJR algorithm is 3(dc −2).”