Sparse Generator Matrices for Some Families of Quasi-Cyclic Low-Density Parity-Check Codes

被引：0
作者：
Baldi, Marco [1 ]
Cancellieri, Giovanni [1 ]
Chiaraluce, Franco [1 ]
机构：
[1] Univ Politec Marche, DII, Ancona, Italy
来源：
2014 22nd International Conference on Software, Telecommunications and Computer Networks (SoftCOM) | 2014年
关键词：
Generator matrix; minimum distance; QC-LDGM codes; QC-LDPC codes; sparse matrices; CIRCULANT MATRICES;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we provide a general form for sparse generator matrices of several families of Quasi-Cyclic Low-Density Parity-Check codes. Codes of this kind have a prominent role in literature and applications due to their ability to achieve excellent performance with limited complexity. While some properties of these codes (like the girth length in their associated Tanner graphs) are well investigated, estimating their minimum distance is still an open problem. By obtaining sparse generator matrices for several families of these codes, we prove that they are also Quasi-Cyclic Low-Density Generator Matrix codes, which is an important feature to reduce the encoding complexity, and provides a useful tool for the investigation of their minimum distance.
引用
收藏
页数：5
相关论文
共 15 条
[1]  
Baldi M., 2012, P SOFTCOM 2012 SPLIT
[2]   Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem [J].
Baldi, Marco ;
Chiaraluce, Franco ;
Garello, Roberto ;
Mininni, Francesco .
2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, :951-+
[3]   On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes [J].
Baldi, Marco ;
Bambozzi, Federico ;
Chiaraluce, Franco .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (09) :6052-6067
[4]  
Cancellieri G., 2014, POLYNOMIAL IN PRESS
[5]   A Matrix-Theoretic Approach for Analyzing Quasi-Cyclic Low-Density Parity-Check Codes [J].
Diao, Qiuju ;
Huang, Qin ;
Lin, Shu ;
Abdel-Ghaffar, Khaled .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) :4030-4048
[6]   More on the Stopping and Minimum Distances of Array Codes [J].
Esmaeili, M. ;
Tadayon, M. H. ;
Gulliver, T. A. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (03) :750-757
[7]   Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J].
Fossorier, MPC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) :1788-1793
[8]  
Fuja T. E., 2001, P ISCTA 2001 AMBL UK
[9]   Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix [J].
Garcia-Frias, J ;
Zhong, W .
IEEE COMMUNICATIONS LETTERS, 2003, 7 (06) :266-268
[10]   A family of irregular LDPC codes with low encoding complexity [J].
Johnson, SJ ;
Weller, SR .
IEEE COMMUNICATIONS LETTERS, 2003, 7 (02) :79-81
12