Connections Between Low-Weight Codewords and Cycles in Spatially Coupled LDPC Convolutional Codes

被引:10
作者
Battaglioni, Massimo [1 ]
Baldi, Marco [1 ]
Cancellieri, Giovanni [1 ]
机构
[1] Univ Politecn Marche, Dipartimento Ingn Informaz, I-60131 Ancona, Italy
关键词
Convolutional codes; cycles; LDPC codes; free Hamming distance; spatially coupled codes; time-invariant codes; DISTANCE; MATRICES;
D O I
10.1109/TCOMM.2018.2820702
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs) are considered, and the connections existing between their low-weight codewords and cycles in their Tanner graphs are studied. Using the polynomial representation of these codes, we show that parity-check matrices having columns with weight >= 2 can he analyzed considering a certain number of parity-check submatrices having regular columns with weight 2. These submatrices are associated to cycles in the code Tanner graph and define as many codes we denote as component codes. Based on this observation, we find that codewords of the main code can he expressed as combinations of codewords of the component codes. The design of codes free of codewords up to a certain weight is also addressed. We show that low-weight codewords in the main code can be avoided by removing some types of cycles in its Tanner graph. Our design approach is applied to some well-known ensembles of SC-LDPC-CCs to prove its effectiveness.
引用
收藏
页码:3268 / 3280
页数:13
相关论文
共 20 条
  • [1] [Anonymous], [No title captured]
  • [2] [Anonymous], P IEEE POW EN SOC GE
  • [3] Baldi M, 2015, INT CONF SOFTW, P330, DOI 10.1109/SOFTCOM.2015.7314104
  • [4] Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
    Dolecek, Lara
    Zhang, Zhengya
    Anantharam, Venkat
    Wainwright, Martin J.
    Nikolic, Borivoje
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) : 181 - 201
  • [5] 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
  • [6] Quasi-cyclic low-density parity-check codes from circulant permutation matrices
    Fossorier, MPC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1788 - 1793
  • [7] On the computation of the minimum distance of low-density parity-check codes
    Hu, XY
    Fossorier, MPC
    Eleftheriou, E
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 767 - 771
  • [8] Huang Q, 2011, IEEE INT SYMP INFO, P1086, DOI 10.1109/ISIT.2011.6033698
  • [9] Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
    Kudekar, Shrinivas
    Richardson, Tom
    Urbanke, Ruediger L.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) : 7761 - 7813
  • [10] Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC
    Kudekar, Shrinivas
    Richardson, Thomas J.
    Urbanke, Ruediger L.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 803 - 834