Abstract | ||
---|---|---|
Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels (BMS), asymptotically, under belief-propagation (BP) decoding. In this paper, we study the BP decoding of these code ensembles over a BMS channel and in the presence of a single random burst of erasures. We show that in the limit of code length, codewords can be recovered successfully if the length of the burst is smaller than some maximum recoverable burst length. We observe that the maximum recoverable burst length is practically the same if the transmission takes place over binary erasure channel or over binary additive white Gaussian channel with the same capacity. Analyzing the stopping sets, we also estimate the decoding failure probability (the error floor) when the code length is finite. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1109/ISTC.2016.7593098 | 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) |
Keywords | DocType | Volume |
spatially coupled LDPC code,erasure single random burst,SC-LDPC ensemble,binary memory less channel capacity,belief-propagation decoding,BP decoding,BMS channel,maximum recoverable burst length,binary erasure channel,binary additive white Gaussian channel,decoding failure probability estimation | Conference | abs/1607.00918 |
ISSN | ISBN | Citations |
2165-4700 | 978-1-5090-3402-4 | 1 |
PageRank | References | Authors |
0.37 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Vahid Aref | 1 | 58 | 6.49 |
Narayanan Rengaswamy | 2 | 1 | 0.37 |
Schmalen, Laurent | 3 | 112 | 32.50 |