Uniformly Reweighted Belief Propagation for Estimation and Detection in Wireless Networks
2012 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 11, no 4, 1587-1595 p.Article in journal (Refereed) Published
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 ρ. We provide a variational interpretation of URW-BP, give insights into good choices of ρ, 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.
Place, publisher, year, edition, pages
2012. Vol. 11, no 4, 1587-1595 p.
Distributed inference, approximate inference, belief propagation, factor graphs, message passing, tree-reweighted belief propagation, variational methods
Engineering and Technology Signal Processing Communication Systems
IdentifiersURN: urn:nbn:se:liu:diva-81321DOI: 10.1109/TWC.2012.021412.111509OAI: oai:DiVA.org:liu-81321DiVA: diva2:551601