Multi-Dimensional Spatially-Coupled Code Design: Enhancing the Cycle Properties

A circulant-permutation-based spatially-coupled (SC) code is constructed by partitioning the circulant permutation matrices (CPMs) in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting 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 one-dimensional counterparts. In our framework, the multi-dimensional coupling is performed via an informed relocation of problematic CPMs. This work is general in the terms of the number of constituent SC codes that are connected together, the number of neighboring SC codes that each constituent SC code is connected to, and the length of the cycles whose populations we aim to reduce. Finally, we present a decoding algorithm that utilizes the structures of the MD-SC code to achieve lower decoding latency. Compared to the conventional SC codes, our MD-SC codes have a notably lower population of small cycles, and a dramatic BER improvement. 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]  Amir H. Banihashemi,et al.  New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes , 2016, IEEE Transactions on Information Theory.

[2]  David G. M. Mitchell,et al.  Edge spreading design of high rate array-based SC-LDPC codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[3]  David G. M. Mitchell,et al.  Efficient Search and Elimination of Harmful Objects in Optimized QC SC-LDPC Codes , 2019, ArXiv.

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

[5]  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).

[6]  Paul H. Siegel,et al.  Windowed Decoding of Spatially Coupled Codes , 2011, 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]  Lara Dolecek,et al.  Spatially-Coupled Code Design for Partial-Response Channels: Optimal Object-Minimization Approach , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[9]  Lara Dolecek,et al.  Multi-Dimensional Spatially-Coupled Code Design Through Informed Relocation of Circulants , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Lara Dolecek,et al.  Spatially Coupled Codes Optimized for Magnetic Recording Applications , 2017, IEEE Transactions on Magnetics.

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

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

[13]  Koji Ishibashi,et al.  Robust Coded Cooperation Based on Multi-Dimensional Spatially-Coupled Repeat-Accumulate Codes , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[14]  Sang-Hyo Kim,et al.  Protograph-Based Folded Spatially Coupled LDPC Codes for Burst Erasure Channels , 2019, IEEE Wireless Communications Letters.

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

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

[18]  Amir H. Banihashemi,et al.  On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes , 2013, IEEE Transactions on Information Theory.

[19]  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).

[20]  Paul H. Siegel,et al.  Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels , 2010, IEEE Transactions on Information Theory.

[21]  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.

[22]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[23]  Stark C. Draper,et al.  Hierarchical and High-Girth QC LDPC Codes , 2011, IEEE Transactions on Information Theory.

[24]  Roxana Smarandache,et al.  Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds , 2009, IEEE Transactions on Information Theory.

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

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

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

[28]  Marco Baldi,et al.  Connections Between Low-Weight Codewords and Cycles in Spatially Coupled LDPC Convolutional Codes , 2018, IEEE Transactions on Communications.

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

[30]  Michael Lentmaier,et al.  Connecting spatially coupled LDPC code chains , 2012, 2012 IEEE International Conference on Communications (ICC).

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

[32]  Christine A. Kelley,et al.  Avoiding trapping sets in SC-LDPC codes under windowed decoding , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).

[33]  Lara Dolecek,et al.  High performance non-binary spatially-coupled codes for flash memories , 2017, 2017 IEEE Information Theory Workshop (ITW).