Fast decoding algorithm for low-density parity-check codes

被引：1

作者：

Wang, D ^{[1
]}

Ping, L

Hu, XY

Wang, XM

机构：

[1] Xidian Univ, State Key Lab ISN, Xian, Shaanxi, Peoples R China

[2] City Univ Hong Kong, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China

[3] IBM Corp, Zurich Res Lab, CH-8803 Ruschlikon, Switzerland

来源：

IEICE TRANSACTIONS ON COMMUNICATIONS | 2005年 / E88B卷 / 11期

关键词：

LDPC code turbo-type two-way algorithm;

D O I：

10.1093/ietcom/e88-b.11.4368

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A fast decoding algorithm for low-density parity-check codes is presented based on graph decomposition and two-way message passing schedule. Simulations show that the convergence speed of the proposed algorithm is about twice that of the conventional belief propagation algorithm.

引用

页码：4368 / 4369

页数：2

共 5 条

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

GALLAGER, RG .

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

[2] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[3] Factor graphs and the sum-product algorithm [J].

Kschischang, FR ;

Frey, BJ ;

Loeliger, HA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :498-519

[4] Iterative decoding of compound codes by probability propagation in graphical models [J].

Kschischang, FR ;

Frey, BJ .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (02) :219-230

[5]

PING L, 2001, IEEE T INFORM THEORY, V47, P791

← 1 →