Uniformly Reweighted Belief Propagation for Estimation and Detection in Wireless Networks

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

Ämnesord

Engineering and Technology  (hsv)

Teknik och teknologier  (hsv)

Engineering and Technology  (hsv)

Electrical Engineering, Electronic Engineering, Information Engineering  (hsv)

Signal Processing  (hsv)

Teknik och teknologier  (hsv)

Elektroteknik och elektronik  (hsv)

Signalbehandling  (hsv)

Communication Systems  (hsv)

Kommunikationssystem  (hsv)

Nyckelord

Distributed inference

approximate inference

belief propagation

factor graphs

message passing

tree-reweighted belief propagation

variational methods