2014/04/06 by Alexios Balatsoukas‐Stimming, Alexios Balatsoukas-Stimming, Andreas Burg +2
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1404.1601
Accepted for publication in IEEE Communications Letters
arxiv created 2014/04/06 · openalex publication_date 2014/04/06 · arxiv updated 2014/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We analyze the performance of quantized min-sum decoding of low-density parity-check codes under unreliable message storage. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently, we formulate the corresponding density evolution equations to predict the average bit error probability in the limit of infinite blocklength. We present numerical threshold results and we show that using more quantization bits is not always beneficial in the context of faulty decoders.