Reduced-complexity decoding of LDPC codes
By Jinghu Chen, Ajay Dholakia, Evangelos Eleftheriou, Marc P. C. Fossorier, Xiao-Yu Hu. IEEE Transactions on Communications, 2005
970 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/7084347ad83b8777736daffccd4bd413493c38f2
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
- David Declercq
- Mohammad Mahdi Azari
- William Shieh
- Amin Azari
- Petar Popovski
- Saeed R. Khosravirad
- Kerry Hinton
- Mahyar Shirvanimoghaddam
In Electrical and Electronic Engineering
- David Declercq
- Kerry Hinton
- Mohammad Mahdi Azari
- William Shieh
- Petar Popovski
- Mahyar Shirvanimoghaddam
- S. Dolinar
- Mojtaba Vaezi
Citations in the corpus
- Capacity-approaching protograph codes (2009, methodology): “We include by reference the BPBased [43] and the Approximate-Min*-BP [44] techniques.”
- Suppressing quantum errors by scaling a surface code logical qubit (2022, neutral): “[69].”
- End-to-End Energy Modeling and Analysis of Long-Haul Coherent Transmission Systems (2014, methodology): “VLSI implementations of LDPC decoding are normally based on the Tanner graph representation of the parity check matrix [93].”
- Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ (2007, background): “also been considered in [13] for nonbinary signaling.”
- Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G (2021, methodology): “Several simplified alternative algorithms, like min-sum [182], normalized minsum [183], and off-set min-sum [183], have been proposed”