Lazy scheduling for LDPC decoding

被引：25

作者：

Levin, Daniel ^{[1
]}

Sharon, Eran ^{[1
]}

Litsyn, Simon ^{[1
]}

机构：

[1] Tel Aviv Univ, Fac Elect Engn, IL-69978 Tel Aviv, Israel

来源：

IEEE COMMUNICATIONS LETTERS | 2007年 / 11卷 / 01期

关键词：

LDPC codes; iterative decoding;

D O I：

10.1109/LCOMM.2007.061454

中图分类号：

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

学科分类号：

0809 ;

摘要：

A complexity reducing method for iterative message passing decoding algorithms of Low-Density Parity-Check (LDPC) codes is described. It is based on lazy scheduling which involves a partial update of messages in the iterations. A Density Evolution (DE) approach is developed for optimization of the parameters for choice of the messages to be updated. Combined with an efficient serial scheduling, the resulting method reduces the decoding complexity by about 70-75% compared to the classical Belief Propagation (BP) scheme, while maintaining the same performance.

引用

页码：70 / 72

页数：3

共 10 条

[1]

BORA PK, P 7 INT S WIR PERS M

[2] Near optimum universal belief propagation based decoding of low-density parity check codes [J].

Chen, JH ;

Fossorier, MPC .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (03) :406-414

[3]

FETTWEIS G, P 11 EUR WIR C 2005

[4]

Gallager RG, 1963, LOW DENSITY PARITY C

[5]

Kim DH, 2006, IEEE COMMUN LETT, V10, P183, DOI [10.1109/LCOMM.2006.03019, 10.1109/LCOMM.2006.1603378]

[6] The capacity of low-density parity-check codes under message-passing decoding [J].

Richardson, TJ ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :599-618

[7]

SHARON E, P TURB COD C 2006

[8]

WANG Y, P 2005 IEEE GLOB TEL

[9]

Zhang JT, 2002, CONF REC ASILOMAR C, P8

[10]

Zhang JT, 2006, IEEE COMMUN LETT, V10, P180, DOI [10.1109/LCOMM.2006.1603377, 10.1109/LCOMM.2006.03005]

← 1 →