Paper Info
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 that of the conventional belief propagation algorithm.
Year
DOI
Venue
2005
10.1093/ietcom/e88-b.11.4368
IEICE Transactions
Keywords
Field
DocType
LDPC code turbo-type two-way algorithm
Factor graph,Concatenated error correction code,BCJR algorithm,Sequential decoding,Berlekamp–Welch algorithm,Low-density parity-check code,Computer science,Parallel computing,Algorithm,List decoding,Belief propagation
Journal
Volume
Issue
ISSN
88-B
11
17451345
ISBN
Citations 
PageRank 
0-7803-9128-4
0
0.34
References 
Authors
5
4
Name
Order
Citations
PageRank
Dan Wang18311.24
Li Ping2104698.88
Xiao Yu Hu3119760.14
Xinmei Wang410914.94