Irregular LDPC codes as concatenation of regular LDPC codes

被引：7

作者：

Fossorier, M ^{[1
]}

Miladinovic, N ^{[1
]}

机构：

[1] Univ Hawaii, Dept Elect Engn, Honolulu, HI 96822 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2005年 / 9卷 / 07期

基金：

美国国家科学基金会;

关键词：

iterative decoding; low density parity check codes; density evolution;

D O I：

10.1109/LCOMM.2005.1461686

中图分类号：

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

学科分类号：

0809 ;

摘要：

In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained counterparts for the BSC. On the other hand, they can offer advantages in term of convergence and error performance for lengths of practical interest and long enough to validate the degree distribution selection.

引用

页码：628 / 630

页数：3

共 6 条

[1]

Amraoui A, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P103

[2]

Gallager RG, 1963, LOW DENSITY PARITY C

[3]

Kasai K, 2003, IEICE T FUND ELECTR, VE86A, P2435

[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]

Richardson T., 2003, MULTIEDGE TYPE LDPC

[6] 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

← 1 →