Spatially Coupled LDPC Ensembles on Burst Erasure Channels
نویسندگان
چکیده
Spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we focus on the performance of these ensembles over binary erasure channels affected additionally by bursts. We assume that the burst can erase either a complete spatial position, modeling node failures in distributed storage, or can span across multiple spatial positions. We study the expected performance of random regular SC-LDPC ensembles on single-burst-erasure channels and provide tight lower bounds for the block erasure probability (PB) at finite block length and bounds on the coupling parameter for being asymptotically able to recover the burst. Subsequently, we show the effect of introducing additional random erasures to these channels. Finally, we show that expurgation can bring substantial improvements in the block error rate by analyzing the minimal stopping sets of some expurgated code ensembles. Our study shows that for a fixed asymptotic code rate, the combination of increasing the variable node degree and expurgating the ensemble can improve the block error probability by several orders of magnitude. All the results are verified using Monte-Carlo simulations.
منابع مشابه
Band Splitting Permutations for Spatially Coupled LDPC Codes Enhancing Burst Erasure Immunity
It is well known that spatially coupled (SC) codes with erasure-BP decoding have powerful error correcting capability over memoryless erasure channels. However, the decoding performance of SC-codes significantly degrades when they are used over burst erasure channels. In this paper, we propose band splitting permutations (BSP) suitable for (l, r, L) SC-codes. The BSP splits a diagonal band in a...
متن کاملImproving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains
In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting shor...
متن کاملSpatially-Coupled LDPC Codes for Transmission over Nonergodic Channels: Recent Advances
This paper resumes our recent advances in the analysis and design of Spatially-Coupled LDPC (SC-LDPC) codes, used for transmission over nonergodic channels, in particular over the block-fading channel and over the block erasure channel. It has been shown that: a) SC-LDPC codes are naturally suitable for nonergodic channel transmission and are robust to packet errors/erasures; b) it is possible ...
متن کاملSpatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the “threshold saturation” effect whereby the belief-propagation (BP) threshold of the spatially-coupled ensemble is boosted to the maximum a-posteriori (MAP)...
متن کاملSpatially Coupled Protograph-Based LDPC Codes for Decode-and-Forward in Erasure Relay Channel
We consider spatially-coupled protograph-based LDPC codes for the three terminal erasure relay channel. It is observed that BP threshold value, the maximal erasure probability of the channel for which decoding error probability converges to zero, of spatially-coupled codes, in particular spatially-coupled MacKay-Neal code, is close to the theoretical limit for the relay channel. Empirical resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.08267 شماره
صفحات -
تاریخ انتشار 2016