Results 1  10
of
132,206
Convergence of weighted minsum decoding via dynamic programming on trees
"... Applying the maxproduct (and beliefpropagation) algorithms to loopy graphs is now quite popular for constraint satisfaction problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understanding of the conditions requi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
required for convergence and/or the optimality of converged solutions. This paper presents an analysis of weighted minsum (a.k.a. attenuated maxproduct) decoding for LDPC codes that guarantees convergence to a fixed point when the weight β is sufficiently small. It also shows that, if the fixed point
Convergence of MinSum MessagePassing for Convex Optimization
, 2007
"... We establish that the minsum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. 1. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We establish that the minsum messagepassing algorithm and its asynchronous variants converge for a large class of unconstrained convex optimization problems. 1.
Convergence of the MinSum Message Passing Algorithm for Quadratic Optimization
, 2006
"... We establish the convergence of the minsum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation. 1 ..."
Abstract
 Add to MetaCart
We establish the convergence of the minsum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation. 1
Convergence of the MinSum Message Passing Algorithm for Quadratic Optimization
, 2008
"... We establish the convergence of the minsum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation. 1 ..."
Abstract
 Add to MetaCart
We establish the convergence of the minsum message passing algorithm for minimization of a quadratic objective function given a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation. 1
Convergence of the MinSum Message Passing Algorithm for Quadratic Optimization
, 2006
"... We establish the convergence of the minsum message passing algorithm for minimization of a broad class of quadratic objective functions: those that admit a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation. 1 ..."
Abstract
 Add to MetaCart
We establish the convergence of the minsum message passing algorithm for minimization of a broad class of quadratic objective functions: those that admit a convex decomposition. Our results also apply to the equivalent problem of the convergence of Gaussian belief propagation. 1
Average minsum decoding of LDPC codes
 5th International Symposium on Turbo Codes and Related Topics
, 2008
"... Abstract—Simulations have shown that the outputs of minsum (MS) decoding generally behave in one of two ways: the output either eventually stabilizes at a codeword or eventually cycles through a finite set of vectors that may include both codewords and noncodewords. This inconsistency in MS across ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
iterations has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average minsum (AMS), is proposed; this decoder outputs the average of the minsum output vectors over a finite set of iterations. Simulations comparing MS, AMS
A MinSum Iterative Decoder Based on Pulsewidth Message Encoding
"... Abstract—In this brief, we introduce a new iterative decoder implementation called pulsewidthmodulated minsum (PWMMS), in which messages are exchanged in a pulsewidthencoded format. The advantages of this method are low switching activity, very low complexity check nodes, low routing congestion, ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract—In this brief, we introduce a new iterative decoder implementation called pulsewidthmodulated minsum (PWMMS), in which messages are exchanged in a pulsewidthencoded format. The advantages of this method are low switching activity, very low complexity check nodes, low routing congestion
Fast Inference with MinSum Matrix Product
, 2011
"... The MAP inference problem in many graphical models can be solved efficiently using a fast algorithm for computing minsum products of n × n matrices. The class of models in question includes cyclic and skipchain models that arise in many applications. Although the worstcase complexity of the mins ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The MAP inference problem in many graphical models can be solved efficiently using a fast algorithm for computing minsum products of n × n matrices. The class of models in question includes cyclic and skipchain models that arise in many applications. Although the worstcase complexity of the minsum
Deriving the Normalized MinSum Algorithm from Cooperative Optimization
, 2006
"... Abstract — The normalized minsum algorithm can achieve nearoptimal performance at decoding LDPC codes. However, it is a critical question to understand the mathematical principle underlying the algorithm. Traditionally, people thought that the normalized minsum algorithm is a good approximation t ..."
Abstract
 Add to MetaCart
Abstract — The normalized minsum algorithm can achieve nearoptimal performance at decoding LDPC codes. However, it is a critical question to understand the mathematical principle underlying the algorithm. Traditionally, people thought that the normalized minsum algorithm is a good approximation
Results 1  10
of
132,206