.png){kind=icon}
.png){kind=icon}
Return
An exponential factor appearance probability belief propagation algorithm for regular and irregular LDPC codes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2015.02.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we present a modified version of the belief propagation algorithm for regular and irregular LDPC codes, the aims of the research presented in this article is to improve convergence and reduce latency. The developed algorithm has two new features, one in the strategy for reweighting check nodes in tanner graph and a second for exploiting the existence of short cycles with an exponential function for the determination of the factor appearance probability. The proposed algorithm is called exponential factor appearance probability belief propagation (EFAP-BP), and is suitable for wireless communication. The simulation results obtained show that the proposed algorithm is better compared to the standard BP and the VFAP-BP algorithms in the literature for both regular and irregular codes. (C) 2015 Elsevier GmbH. All rights reserved.
Keywords:
BP
VFAP-BP
Reweighting the factor graph
Girth
Low-latency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
3.2
Papers:
5.6K
Citations:
8.3K