Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 19 Jan 2015 in cs.IT and math.IT | (1501.04394v1)

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.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.