Fast Decoding Algorithm for Low-Density Parity-Check Codes

Dan WANG; Ping LI; Xiao Yu HU; Xin Mei WANG

doi:10.1109/MAPE.2005.1618116

Fast Decoding Algorithm for Low-Density Parity-Check Codes

Dan WANG
, Ping LI
, Xiao Yu HU
, Xin Mei WANG

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

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.

Original language	English
Title of host publication	MAPE2005 - IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Proceedings
Editors	Linchang Zhang, Yinghong Wen
Pages	1115-1118
Volume	2
DOIs	https://doi.org/10.1109/MAPE.2005.1618116
Publication status	Published - Aug 2005
Externally published	Yes
Event	IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE2005) - Beijing, China Duration: 8 Aug 2005 → 12 Aug 2005

Conference

Conference	IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE2005)
Place	China
City	Beijing
Period	8/08/05 → 12/08/05

Access Output

10.1109/MAPE.2005.1618116

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{98854021361c4afd8252d8553558bb52,

title = "Fast Decoding Algorithm for Low-Density Parity-Check Codes",

abstract = "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.",

author = "Dan WANG and Ping LI and HU, \{Xiao Yu\} and WANG, \{Xin Mei\}",

year = "2005",

month = aug,

doi = "10.1109/MAPE.2005.1618116",

language = "English",

isbn = "0780391284",

volume = "2",

pages = "1115--1118",

editor = "Linchang Zhang and Yinghong Wen",

booktitle = "MAPE2005 - IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Proceedings",

note = "IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE2005) ; Conference date: 08-08-2005 Through 12-08-2005",

}

WANG, D, LI, P, HU, XY & WANG, XM 2005, Fast Decoding Algorithm for Low-Density Parity-Check Codes. in L Zhang & Y Wen (eds), MAPE2005 - IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Proceedings. vol. 2, 1618116, pp. 1115-1118, IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE2005), Beijing, China, 8/08/05. https://doi.org/10.1109/MAPE.2005.1618116

Fast Decoding Algorithm for Low-Density Parity-Check Codes. / WANG, Dan; LI, Ping; HU, Xiao Yu et al.
MAPE2005 - IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Proceedings. ed. / Linchang Zhang; Yinghong Wen. Vol. 2 2005. p. 1115-1118 1618116.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Fast Decoding Algorithm for Low-Density Parity-Check Codes

AU - WANG, Dan

AU - LI, Ping

AU - HU, Xiao Yu

AU - WANG, Xin Mei

PY - 2005/8

Y1 - 2005/8

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33847309120

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33847309120&origin=recordpage

U2 - 10.1109/MAPE.2005.1618116

DO - 10.1109/MAPE.2005.1618116

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0780391284

SN - 9780780391284

VL - 2

SP - 1115

EP - 1118

BT - MAPE2005 - IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, Proceedings

A2 - Zhang, Linchang

A2 - Wen, Yinghong

T2 - IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE2005)

Y2 - 8 August 2005 through 12 August 2005

ER -

Fast Decoding Algorithm for Low-Density Parity-Check Codes

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this