Fast decoding algorithm for low-density parity-check codes

被引：0

作者：

Wang, D ^{[1
]}

Li, P ^{[1
]}

Hu, XY ^{[1
]}

Wang, XM ^{[1
]}

机构：

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

来源：

IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications Proceedings, Vols 1 and 2 | 2005年

关键词：

D O I：

暂无

中图分类号：

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 as fast as that of the conventional belief propagation algorithm.

引用

页码：1115 / 1118

页数：4

共 6 条

[1] LOW-DENSITY PARITY-CHECK CODES
GALLAGER, RG
[J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01): : 21 - &
[2] HU X, REGULAR IRREGULAR PR
[3] Factor graphs and the sum-product algorithm
Kschischang, FR
Frey, BJ
Loeliger, HA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 498 - 519
[4] Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, FR
Frey, BJ
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (02) : 219 - 230
[5] Near Shannon limit performance of low density parity check codes
MacKay, DJC
Neal, RM
[J]. ELECTRONICS LETTERS, 1996, 32 (18) : 1645 - 1646
[6] PING L, 2001, IEEE T INFORM THEORY, V47, P791

← 1 →