Utilizing the measured distance and information exchanged between two different nodes to cooperatively locate in a mobile network has become solution replace global navigation satellite system (GNSS) positioning. However, localization accuracy of belief propagation-based cooperative scheme is substantially influenced by number neighbors. In this paper, we propose combined with trajectory tracki...

In non-ergodic belief networks the posterior belief of many queries given evidence may become zero. The paper shows that when belief propagation is applied iteratively over arbitrary networks (the so called, iterative or loopy belief propagation (IBP)) it is identical to an arc-consistency algorithm relative to zero-belief queries (namely assessing zero posterior probabilities). This implies th...

We discuss schemes for exact and approximate computations of permanents, and compare them with each other. Specifically, we analyze the belief propagation (BP) approach and its fractional belief propagation (FBP) generalization for computing the permanent of a non-negative matrix. Known bounds and Conjectures are verified in experiments, and some new theoretical relations, bounds and Conjecture...

We propose a nonparametric generalization of belief propagation, Kernel Belief Propagation (KBP), for pairwise Markov random fields. Messages are represented as functions in a reproducing kernel Hilbert space (RKHS), and message updates are simple linear operations in the RKHS. KBP makes none of the assumptions commonly required in classical BP algorithms: the variables need not arise from a fi...

We consider belief propagation (BP) as an efficient and scalable tool for state estimation optimization problems in supply networks such power grids. BP algorithms make use of factor graph representations, whose assignment to the problem interest is not unique. It depends on variables their mutual interdependencies. Many short loops graphs may impede accuracy BP. propose a systematic way cluste...

In this paper, relaxed belief propagation (RBP) based detectors are proposed for multiple-input multiple-out (MIMO) system. The factor graph is leveraged to represent the MIMO channels, and based on which our algorithms are developed. Unlike the existing complicated standard belief propagation (SBP) detector that considers all the edges of the factor graph when updating messages, the proposed R...

Despite the great promises that resistive random access memory (ReRAM) has shown as next generation of non-volatile technology, its crossbar array structure leads to a severe sneak path interference signal read back from cell. In this paper, we first propose novel belief propagation (BP) based detector for in ReRAM. Based on conditions occur and dependence states cells are involved path, Tanner...

Abstract In this research, we study soft-output decoding of polar codes. Two representative algorithms are belief propagation (BP) and soft cancellation (SCAN). The BP algorithm has low latency but suffers from high computational complexity. On the other hand, SCAN algorithm, which is proposed for reduced complexity decoding, achieves good performance long latency. These two suitable only extre...

Short algebraic codes promise low-delay data transmission and good performance results when transmitted over the additive white Gaussian noise (AWGN) channel and decoded by maximum-likelihood (ML) soft-decision decoding. One reason for this is the large minimum distance of these codes. For belief-propagation (BP) decoding, short algebraic codes show suboptimal results due to their high-density ...