LDPC code optimization based on Tanner graph mutations

被引：0
|
作者：
Broulim, Jan [1 ]
Georgiev, Vjaceslav [1 ]
Moldaschl, Jan [1 ]
Palocko, Lukas [1 ]
机构：
[1] Univ W Bohemia, Fac Elect Engn, Plzen 30614, Czech Republic
来源：
2013 21ST TELECOMMUNICATIONS FORUM (TELFOR) | 2013年
关键词：
FEC; genetic optimization; LDPC; DESIGN;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The paper presents LDPC error correcting code optimization based on Tanner graph mutations. A statistical experiment focused on a heuristic LDPC code construction was performed with the genetic algorithm. The algorithm used is briefly described. Short wordlength LDPC code optimization was simulated. Results of these simulations are summarized in this paper.
引用
收藏
页码：389 / 392
页数：4
相关论文
共 50 条
  • [1] On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles
    Dehghan, Ali
    Banihashemi, Amir H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (06) : 4438 - 4451
  • [2] Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    Kharin, A.V.
    Zavertkin, K.N.
    Ovinnikov, A.A.
    1600, Pleiades journals (56): : 317 - 331
  • [3] Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    A. V. Kharin
    K. N. Zavertkin
    A. A. Ovinnikov
    Problems of Information Transmission, 2020, 56 : 173 - 184
  • [4] Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    Kharin, A., V
    Zavertkin, K. N.
    Ovinnikov, A. A.
    PROBLEMS OF INFORMATION TRANSMISSION, 2020, 56 (02) : 173 - 184
  • [5] Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    Kharin, A. V.
    Zavertkin, K. N.
    Ovinnikov, A. A.
    PROBLEMS OF INFORMATION TRANSMISSION, 2020, 56 (04) : 317 - 331
  • [6] Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    A. V. Kharin
    K. N. Zavertkin
    A. A. Ovinnikov
    Problems of Information Transmission, 2020, 56 : 317 - 331
  • [7] Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC code
    Kong, Lingjun
    Xiao, Yang
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2010, 21 (01) : 134 - 137
  • [8] Construction of LDPC Codes with Cycles Hold in Tanner Graph
    Liu, Binbin
    Mei, Shunliang
    Bai, Dong
    2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 838 - +
  • [9] Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC code
    Lingjun Kong and Yang Xiao Institute of Information Science
    Journal of Systems Engineering and Electronics, 2010, 21 (01) : 134 - 137
  • [10] Girth of the Tanner Graph and Error Correction Capability of LDPC Codes
    Chilappagari, Shashi Kiran
    Nguyen, Dung Viet
    Vasic, Bane
    Marcellin, Michael W.
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1238 - 1245
12345