Necessary Conditions for Avoiding Cycles of Length 4 or 6 in Regular quasi-cyclic LDPC Codes

被引：0
|
作者：
Kim, Kyung-Joong [1 ]
Chung, Jin-Ho [1 ]
Yang, Kyeongcheol [1 ]
机构：
[1] Pohang Univ Sci & Technol POSTECH, Dept Elect Engn, Pohang 790784, Gyungbuk, South Korea
来源：
18TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC 2012): GREEN AND SMART COMMUNICATIONS FOR IT INNOVATION | 2012年
基金：
新加坡国家研究基金会;
关键词：
PARITY-CHECK CODES;
D O I：
暂无
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
In this paper we investigate the cycle properties of regular quasi-cyclic low-density parity-check (QC-LDPC) codes. Using the sequence representation, we analyze the conditions for short cycles to exist in regular QC-LDPC codes and then give necessary conditions for avoiding short cycles in terms of their parameters. Numerical results show that our bounds on the number of rows in the parity-check matrices for regular QC-LDPC codes without cycles of length 4 or 6 are tighter than any other known bounds.
引用
收藏
页码：585 / 590
页数：6
相关论文
共 50 条
  • [1] Quasi-Cyclic Asymptotically Regular LDPC Codes
    Mitchell, David G. M.
    Smarandache, Roxana
    Lentmaier, Michael
    Costello, Daniel J., Jr.
    [J]. 2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
  • [2] Regular and Irregular Quasi-Cyclic LDPC Codes
    Jiang, Xueqin
    Lee, Moon Ho
    Hou, Jia
    [J]. 2011 IEEE 73RD VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2011,
  • [3] Necessary Conditions for Quasi-Cyclic LDPC Codes to Have a Given Girth
    Kim, Kyung-Joong
    Chung, Jin-Ho
    Yang, Kyeongcheol
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2661 - +
  • [4] On regular quasi-cyclic LDPC codes from binomials
    Smarandache, R
    Vontobel, PO
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 274 - 274
  • [5] Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes
    Smarandache, Roxana
    Mitchell, David G. M.
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 380 - 385
  • [6] Construction of Regular Quasi-Cyclic LDPC Codes Based on Cosets
    Chen, Pengcheng
    Tang, Yuansheng
    Cao, Zhanghua
    Yan, Tingsu
    [J]. 2009 2ND INTERNATIONAL CONFERENCE ON COMPUTER, CONTROL AND COMMUNICATION, 2009, : 218 - 221
  • [7] A Novel Algorithm for Removing Cycles in Quasi-Cyclic LDPC Codes
    Liu, Keke
    Fei, Zesong
    Kuang, Jingming
    Li, Xiangming
    [J]. 2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2009, : 1054 - 1058
  • [8] A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes
    Wu, Xiaofu
    You, Xiaohu
    Zhao, Chunming
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (06) : 854 - 857
  • [9] A construction of the high-rate regular quasi-cyclic LDPC codes
    Qi Meng
    Jia Xiang Zhao
    Wei Xu
    Liang Li
    [J]. EURASIP Journal on Wireless Communications and Networking, 2019
  • [10] Quantum quasi-cyclic LDPC codes
    Hagiwara, Manabu
    Imai, Hideki
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 806 - +
12345