Spatially Coupled Codes with Sub-Block Locality: Joint Finite Length-Asymptotic Design Approach

SC-LDPC codes with sub-block locality can be decoded locally at the level of sub-blocks that are much smaller than the full code block, thus providing fast access to the coded information. The same code can also be decoded globally using the entire code block, for increased data reliability. In this paper, we pursue the analysis and design of such codes from both finite-length and asymptotic lenses. This mixed approach has rarely been applied in designing SC codes, but it is beneficial for optimizing code graphs for local and global performance simultaneously. Our proposed framework consists of two steps: 1) designing the local code for both threshold and cycle counts, and 2) designing the coupling of local codes for the best cycle count in the global design.

[1]  Yuval Cassuto,et al.  Spatially Coupled LDPC Codes with Random Access , 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

[2]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[3]  Yuval Cassuto,et al.  LDPC Codes with Local and Global Decoding , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

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

[6]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

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

[9]  Michael Lentmaier,et al.  Spatially Coupled LDPC Codes Constructed From Protographs , 2014, IEEE Transactions on Information Theory.

[10]  Martin Bossert,et al.  Multi-block interleaved codes for local and global read access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  Michael Lentmaier,et al.  AWGN channel analysis of terminated LDPC convolutional codes , 2011, 2011 Information Theory and Applications Workshop.

[12]  Lara Dolecek,et al.  Absorbing set characterization of array-based spatially coupled LDPC codes , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.