A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes

被引:16
|
作者
Lan, L [1 ]
Tai, YY [1 ]
Chen, L [1 ]
Lin, S [1 ]
Abdel-Ghaffar, K [1 ]
机构
[1] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
基金
美国国家科学基金会; 美国国家航空航天局;
关键词
bipartite graphs; girth; low density parity check (LDPC) codes;
D O I
10.1109/lcomm.2004.832776
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.
引用
收藏
页码:443 / 445
页数:3
相关论文
共 50 条
  • [31] On the construction of quasi-cyclic low-density parity-check codes based on girth
    Okamura, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (09) : 2432 - 2439
  • [32] A systematic construction of irregular low-density parity-check codes from combinatorial designs
    Sankaranarayanan, S
    Vasic, B
    Kurtas, EM
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 1 - 1
  • [33] Low density parity check lattices based on Construction D′ and cycle-free Tanner graphs
    Sadeghi, MR
    Panario, D
    Algebraic Coding Theory and Information Theory, 2005, 68 : 85 - 90
  • [34] On algebraic construction of Gallager and circulant low-density parity-check codes
    Tang, H
    Xu, J
    Kou, Y
    Lin, S
    Abdel-Ghaffar, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) : 1269 - 1279
  • [35] Graph-theoretic construction of low-density parity-check codes
    Djurdjevic, I
    Lin, S
    Abdel-Ghaffar, K
    IEEE COMMUNICATIONS LETTERS, 2003, 7 (04) : 171 - 173
  • [36] On construction of rate-compatible low-density parity-check codes
    Yazdani, M
    Banihashemi, AH
    2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 430 - 434
  • [37] On construction of rate-compatible low-density parity-check codes
    Yazdani, MR
    Banihashemi, AH
    IEEE COMMUNICATIONS LETTERS, 2004, 8 (03) : 159 - 161
  • [38] Graph-theoretic construction of low-density parity-check codes
    Djurdjevic, I
    Shu, L
    Abdel-Ghaffar, K
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 31 - 31
  • [39] Coset graphs for low-density parity check codes: performance on the binary erasure channel
    Lauri, J.
    Tjhai, C. J.
    IET COMMUNICATIONS, 2011, 5 (05) : 719 - 727
  • [40] Construction of Memory Circuits Using Unreliable Components Based on Low-Density Parity-Check Codes
    Ivkovic, Milos
    Chilappagari, Shashi Kiran
    Vasic, Bane
    GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006,