Abstract

In this paper, we present two types of spatially coupled generalized low density parity check (SC-GLDPC) codes to combat burst erasures. Compared with the spatially coupled low density parity check (SC-LDPC) codes, SC-GLDPC codes introduce the super check nodes instead of the standard single parity check constraints, which is beneficial to the burst erasure corrections. To evaluate the capability against burst erasures, density evolution algorithm for SC-GLDPC codes is proposed, which can be used to compute the maximum length of the consecutive burst erasures when transmitted over the burst erasure channels. Density evolution analysis results show that the burst erasure correction performances of these two types of SC-GLDPC codes are better than SC-LDPC codes while Type-2 SC-GLDPC codes perform better than Type-1 SC-GLDPC codes. To demonstrate the excellent asymptotic performances, we also simulate the finite-length performances of these two types of SC-GLPDC codes over burst erasure channels along with SC-LDPC codes for comparison. Simulation results show that the finite-length performances are consistent with the asymptotic performances obtained by density evolution.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call