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

来源：

IEEE COMMUNICATIONS LETTERS | 2004年 / 8卷 / 07期

基金：

美国国家科学基金会; 美国国家航空航天局;

关键词：

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

共 9 条

[1] CHEN L, 2004, IN PRESS IEEE T COMM, V52
[2] Gallager RG, 1963, LOW DENSITY PARITY C
[3] HU X, 2001, P IEEE GLOBECOM SAN
[4] Lin S., 1998, KLUWER INT SER ENG C
[5] Lin S., 2004, ERROR CONTROL CODING
[6] Good error-correcting codes based on very sparse matrices
MacKay, DJC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) : 399 - 431
[7] The capacity of low-density parity-check codes under message-passing decoding
Richardson, TJ
Urbanke, RL
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 599 - 618
[8] A RECURSIVE APPROACH TO LOW COMPLEXITY CODES
TANNER, RM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (05) : 533 - 547
[9] West D. B., 2002, Introduction to Graph Theory

← 1 →