|
Descripción
|
|
|---|---|
| In this paper, we propose a new inference algorithm, suitable for distributed processing over wireless networks. The algorithm, called uniformly reweighted belief propagation (URW-BP), combines the local nature of belief propagation with the improved performance of tree-reweighted belief propagation (TRW-BP) in graphs with cycles. It reduces the degrees of freedom in the latter algorithm to a single scalar variable, the uniform edge appearance probability rho. We provide a variational interpretation of URW-BP, give insights into good choices of rho, develop an extension to higher-order potentials, and complement our work with numerical performance results on three inference problems in wireless communication systems: spectrum sensing in cognitive radio, cooperative positioning, and decoding of a low-density parity-check (LDPC) code. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
IEEE transactions on wireless communications |
|
ISSN
|
1536-1276 |
|
Factor de impacto JCR
|
2,15 |
|
Información de impacto
|
|
|
Volumen
|
|
|
DOI
|
10.1109/TWC.2012.021412.111509 |
|
Número de revista
|
|
|
Desde la página
|
1 |
|
Hasta la página
|
9 |
|
Mes
|
SIN MES |
|
Ranking
|
|