Forward Error correcting Codes (FEC) is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. This scheme is overhead in many wireless communication systems, even though they have enhanced data rates for the GSM evolution (EDGE), because, worldwide interoperability for microwave access (WiMAX) and long term evolution (LTE) have adopted low...

We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Belief Propagation, smoothly interpolates two well-known inference procedures; it s...

We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Belief Propagation, smoothly interpolates two well-known inference procedures; it s...

Belief Propagation (BP) is a message-passing algorithm that computes the exact marginal distributions at every vertex of a graphical model without cycles. While BP is designed to work correctly on trees, it is routinely applied to general graphical models that may contain cycles, in which case neither convergence, nor correctness in the case of convergence is guaranteed. Nonetheless, BP gained ...

The rapid development of the mobile communications requires ever higher spectral efficiency. The non-orthogonal multiple access (NOMA) has emerged as a promising technology to further increase the access efficiency of wireless networks. Amongst several NOMA schemes, the sparse code multiple access (SCMA) has been shown to be able to achieve better performance. In this paper, we consider a downl...

This article focuses on the distributed static estimation problem. A belief propagation (BP) based algorithm is studied for its convergence and accuracy. More precisely, we give conditions under which BP-based estimator guaranteed to converge concrete characterizations Our results reveal new insights properties of this algorithm, leading better theoretical understanding state applications algor...

Low-density parity-check (LDPC) codes are very efficient for communicating reliably through a noisy channel. N.Sourlas [1] showed that LDPC codes, which revolutionize the codes domain and used in many communications standards, can be mapped onto an Ising spin systems. Besides, it has been shown that the Belief-Propagation (BP) algorithm, the LDPC codes decoding algorithm, is equivalent to the T...

Systems and control theory have found wide application in the analysis and design of numerical algorithms. We present a discrete-time dynamical system interpretation of an algorithm commonly used in information theory called Belief Propagation. Belief Propagation (BP) is one instance of the so-called Sum-Product Algorithm and arises, e.g., in the context of iterative decoding of Low-Density Par...

Restricted Boltzmann machines (RBMs) and conditional RBMs (CRBMs) are popular models for a wide range of applications. In previous work, learning on such models has been dominated by contrastive divergence (CD) and its variants. Belief propagation (BP) algorithms are believed to be slow for structured prediction on conditional RBMs (e.g., Mnih et al. [2011]), and not as good as CD when applied ...

The popularity of particle filtering for inference in Markov chain models defined over random variables with very large or continuous domains makes it natural to consider sample–based versions of belief propagation (BP) for more general (tree–structured or loopy) graphs. Already, several such algorithms have been proposed in the literature. However, many questions remain open about the behavior...