Multi-dimensional spatially-coupled codes

Spatially-coupled (SC) codes are constructed by coupling many regular low-density parity-check codes in a chain. The decoding chain of SC codes aborts when facing burst erasures. This problem cannot be overcome by increasing the chain length. In this paper, we introduce multi-dimensional (MD) SC codes to circumvent it. Numerical results show that two-dimensional SC codes are more robust against the burst erasures than one-dimensional SC codes. Furthermore, we consider designing multidimensional SC codes with smaller rateloss.

[1]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[2]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[3]  Gerhard Fettweis,et al.  On the thresholds of generalized LDPC convolutional codes based on protographs , 2010, 2010 IEEE International Symposium on Information Theory.

[4]  Nicolas Macris,et al.  A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  Kenta Kasai,et al.  A Potential Theory of General Spatially-Coupled Systems via a Continuum Approximation , 2013, ArXiv.

[6]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[7]  Rüdiger L. Urbanke,et al.  Spatially coupled ensembles universally achieve capacity under belief propagation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[8]  Michael Lentmaier,et al.  Implementation aspects of LDPC convolutional codes , 2008, IEEE Transactions on Communications.