pith. sign in

arxiv: 1501.04394 · v1 · pith:A3337Y3Cnew · submitted 2015-01-19 · 💻 cs.IT · math.IT

Band Splitting Permutations for Spatially Coupled LDPC Codes Enhancing Burst Erasure Immunity

classification 💻 cs.IT math.IT
keywords burstsc-codeserasurebandpermutedbaseboundschannels
0
0 comments X
read the original abstract

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 base matrix into multiple bands in order to enhance the span of the stopping sets in the base matrix. As theoretical performance guarantees, lower and upper bounds on the maximal burst correctable length of the permuted $(l,r,L)$ SC-codes are presented. Those bounds indicate that the maximal correctable burst ratio of the permuted SC-codes converges to 1/k where k=r/l. This implies the asymptotic optimality of the permuted SC-codes in terms of burst erasure correction.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.