Multi-Dimensional Spatially-Coupled Code Design Through Informed Relocation of Circulants

A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants of an underlying block code into a number of components, and then coupling copies of these components together. By connecting (coupling) several SC codes, multi-dimensional SC (MD-SC) codes are constructed. In this paper, we present a systematic framework for constructing MD-SC codes with notably better cycle properties than their 1D-SC counterparts. In our framework, informed multi-dimensional coupling is performed via an optimal relocation and an (optional) power adjustment of problematic circulants in the constituent SC codes. Compared to the 1D-SC codes, our MD-SC codes are demonstrated to have up to 85% reduction in the population of the smallest cycle, and up to 3.8 orders of magnitude BER improvement in the early error floor region. The results of this work can be particularly beneficial in data storage systems, e.g., 2D magnetic recording and 3D Flash systems, as high-performance MD-SC codes are robust against various channel impairments and non-uniformity.

[1]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

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

[3]  Laurent Schmalen,et al.  Laterally connected spatially coupled code chains for transmission over unstable parallel channels , 2014, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[4]  Lara Dolecek,et al.  Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.

[5]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[6]  Ying Li,et al.  Spatially Coupled LDPC Codes Constructed by Parallelly Connecting Multiple Chains , 2015, IEEE Communications Letters.

[7]  Pablo M. Olmos,et al.  A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains , 2013, 2013 IEEE Information Theory Workshop (ITW).

[8]  Michael Lentmaier,et al.  New codes on graphs constructed by connecting spatially coupled chains , 2012, 2012 Information Theory and Applications Workshop.

[9]  Kenta Kasai,et al.  Multi-dimensional spatially-coupled codes , 2013, 2013 IEEE International Symposium on Information Theory.

[10]  Lara Dolecek,et al.  Finite-Length Construction of High Performance Spatially-Coupled Codes via Optimized Partitioning and Lifting , 2019, IEEE Transactions on Communications.

[11]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.