A Method for Constructing Parity-Check Matrices of Quasi-Cyclic LDPC Codes Over GF(q)

被引：1
|
作者：
Kruglik, S. A. [1 ,2 ]
Potapova, V. S. [1 ,2 ]
Frolov, A. A. [1 ,2 ]
机构：
[1] Skolkovo Inst Sci & Technol, Moscow 121205, Russia
[2] Russian Acad Sci, Kharkevich Inst Informat Transmiss Problems, Moscow 127051, Russia
来源：
JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS | 2018年 / 63卷 / 12期
基金：
俄罗斯科学基金会;
关键词：
LDPC code; parity-check matrix; iterative decoding threshold; Tanner graph; cycle; Galois field;
D O I：
10.1134/S1064226918120112
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
An algorithm for constructing parity-check matrices of non-binary quasi-cyclic low-density parity-check (NB QC-LDPC) codes is proposed. The algorithm finds short cycles in the base matrix and tries to eliminate them by selecting the circulants and the elements of GF(q). The algorithm tries to eliminate the cycles with the smallest number edges going outside the cycle. The efficiency of the algorithm is demonstrated by means of simulations. In order to explain the simulation results we also derive upper bounds on the minimum distance of NB QC-LDPC codes.
引用
收藏
页码：1524 / 1529
页数：6
相关论文
共 50 条
  • [21] Efficient encoding of quasi-cyclic low-density parity-check codes
    Li, ZW
    Chen, L
    Zeng, LQ
    Lin, S
    Fong, WH
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (01) : 71 - 81
  • [22] Efficient encoding of quasi-cyclic low-density parity-check codes
    Li, ZW
    Chen, L
    Zeng, LQ
    Lin, S
    Fong, W
    [J]. GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1205 - 1210
  • [23] A Special Class of Quasi-cyclic Low-Density Parity-Check Codes Based on Repetition Codes and Permutation Matrices
    Ivanov, F. I.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2017, 53 (03) : 229 - 241
  • [24] A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices
    F. I. Ivanov
    [J]. Problems of Information Transmission, 2017, 53 : 229 - 241
  • [25] Reduced Complexity Implementation of Quasi-Cyclic LDPC Decoders by Parity-Check Matrix Reordering
    Su, Jianing
    Lu, Zhenghao
    [J]. 2013 IEEE 10TH INTERNATIONAL CONFERENCE ON ASIC (ASICON), 2013,
  • [26] Density optimisation of generator matrices of quasi-cyclic low-density parity-check codes and their rank analysis
    Zhang, Mu
    Huang, Qin
    Wang, Zulin
    Yuan, Shuai
    Liu, Zhe
    [J]. IET COMMUNICATIONS, 2014, 8 (14) : 2547 - 2555
  • [27] Near Shannon limit quasi-cyclic low-density parity-check codes
    Lin, S
    Chen, L
    Xu, J
    Djurdjevic, I
    [J]. GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 2030 - 2035
  • [28] On the usage of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem
    Baldi, Marco
    Chiaraluce, Franco
    Garello, Roberto
    [J]. 2006 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND ELECTRONICS, 2006, : 305 - +
  • [29] On the construction of quasi-cyclic low-density parity-check codes based on girth
    Okamura, T
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (09) : 2432 - 2439
  • [30] Parallel-in encoding of quasi-cyclic low-density parity-check codes
    Zhang, Peng
    Du, Shuai
    Liu, Changyin
    Jiang, Qianqian
    [J]. JOURNAL OF ENGINEERING-JOE, 2016,
12345