2017/01/26 by Laurent Schmalen, Schmalen, Laurent, Vahid Aref +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1701.07629
openalex publication_date 2017/01/26 · openalex created_date 2022/08/14 · openalex updated_date 2026/07/28
We consider spatially coupled low-density parity-check codes with finite\nsmoothing parameters. A finite smoothing parameter is important for designing\npractical codes that are decoded using low-complexity windowed decoders. By\noptimizing the amount of coupling between spatial positions, we show that we\ncan construct codes with excellent thresholds and small rate loss, even with\nthe lowest possible smoothing parameter and large variable node degrees, which\nare required for low error floors. We also establish that the decoding\nconvergence speed is faster with non-uniformly coupled codes, which we verify\nby density evolution of windowed decoding with a finite number of iterations.\nWe also show that by only slightly increasing the smoothing parameter,\npractical codes with potentially low error floors and thresholds close to\ncapacity can be constructed. Finally, we give some indications on protograph\ndesigns.\n