Graph-theoretic construction of low-density parity-check codes

被引：6

作者：

Djurdjevic, I ^{[1
]}

Lin, S ^{[1
]}

Abdel-Ghaffar, K ^{[1
]}

机构：

[1] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2003年 / 7卷 / 04期

基金：

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

关键词：

low-density parity-check (LDPC) codes; sum-product algorithm; Tanner graph; trellis;

D O I：

10.1109/LCOMM.2003.809990

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

This letter presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.

引用

页码：171 / 173

页数：3

共 13 条

[1] LOW-DENSITY PARITY-CHECK CODES [J].

GALLAGER, RG .

IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&

[2]

Lin S., 1983, ERROR CONTROL CODING

[3]

Lin S., 1998, KLUWER INT SER ENG C

[4] Improved low-density parity-check codes using irregular graphs [J].

Luby, MG ;

Mitzenmacher, M ;

Shokrollahi, MA ;

Spielman, DA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :585-598

[5] Good error-correcting codes based on very sparse matrices [J].

MacKay, DJC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431

[6]

Massey J. L., 1963, THRESHOLD DECODING

[7] Design of capacity-approaching irregular low-density parity-check codes [J].

Richardson, TJ ;

Shokrollahi, MA ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :619-637

[8]

Rosenthal J., 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), DOI 10.1109/ISIT.2001.935867

[9] Expander codes [J].

Sipser, M ;

Spielman, DA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1710-1722

[10] A RECURSIVE APPROACH TO LOW COMPLEXITY CODES [J].

TANNER, RM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (05) :533-547

← 1 2 →