Band Splitting Permutations for Spatially Coupled LDPC Codes Achieving Asymptotically Optimal Burst Erasure Immunity

被引:3
作者
Mori, Hiroki [1 ]
Wadayama, Tadashi [1 ]
机构
[1] Nagoya Inst Technol, Nagoya, Aichi 4668555, Japan
关键词
spatially coupled LDPC codes; burst erasure; stopping sets; belief propagation; PARITY-CHECK CODES;
D O I
10.1587/transfun.E100.A.663
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
It is well known that spatially coupled (SC) codes with erasure-BP decoding have powerful error correcting capability over memoryless erasure channels. However, the decoding performance of SC-codes significantly degrades when they are used over burst erasure channels. In this paper, we propose band splitting permutations (BSP) suitable for (1, r, L) SC-codes. The BSP splits a diagonal band in a base matrix into multiple bands in order to enhance the span of the stopping sets in the base matrix. As theoretical performance guarantees, lower and upper bounds on the maximal burst correctable length of the permuted (1, r, L) SC-codes are presented. Those bounds indicate that the maximal correctable burst ratio of the permuted SC-codes is given by lambda(max) = 1/k where k = r11. This implies the asymptotic optimality of the permuted SC-codes in terms of burst erasure correction.
引用
收藏
页码:663 / 669
页数:7
相关论文
共 17 条
  • [1] Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839
  • [2] Time-varying periodic convolutional codes with low-density parity-check matrix
    Felstrom, AJ
    Zigangirov, KS
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) : 2181 - 2191
  • [3] Gallager R.G., 1962, Low density parity-check codes
  • [4] A modification method for constructing low-density parity-check codes for burst erasures
    Hosoya, Gou
    Yagi, Hideki
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (10) : 2501 - 2509
  • [5] Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC
    Kudekar, Shrinivas
    Richardson, Tom
    Urbanke, Ruediger
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 684 - 688
  • [6] To the Theory of Low-Density Convolutional Codes. II
    M. Lentmaier
    D. V. Truhachev
    K. Sh. Zigangirov
    [J]. Problems of Information Transmission, 2001, 37 (4) : 288 - 306
  • [7] Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
    Lentmaier, Michael
    Sridharan, Arvind
    Costello, Daniel J., Jr.
    Zigangirov, Kamil Sh.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) : 5274 - 5289
  • [8] Ohashi R, 2013, IEEE INT SYMP INFO, P2448, DOI 10.1109/ISIT.2013.6620666
  • [9] Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
    Paolini, Enrico
    Chiani, Marco
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (05) : 1320 - 1328
  • [10] Rengaswamy N., 2016, P 2016 INT ZUR SEM C