Jon Feldman, Martin Wainwright, David R. Karger
In recent work (Feldman and Karger [8]), we introduced a new approach to decoding turbo-like codes based on linear programming (LP). We gave a precise characterization of the noise patterns that...
Explaining Cortical Adaptation with a Statistically Optimized Normalization Model (2008)
Martin Wainwright, Eero Simoncelli
Hypothesis: sensory systems are matched to their input statistics
Evaluation of the Low Frame Error Rate Performance of LDPC Codes Using Importance Sampling (2008)
Lara Dolecek, Zhengya Zhang, Martin Wainwright, Venkat Anantharam, Borivoje Nikolić
Abstract — We present an importance sampling method for the evaluation of the low frame error rate (FER) performance of LDPC codes under iterative decoding. It relies on a combinatorial...
Tree consistency and bounds on the performance of (2007)
Martin Wainwright, Tommi Jaakkola, Alan Willsky
the max-product algorithm and its generalizations
Martin Wainwright, Tommi Jaakkola, Alan Willsky
Tree-based reparameterization framework for analysis of belief propagation and related algorithms
Martin Wainwright, Tommi Jaakkola, Alan Willsky
MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches
Quantization effects of low-density parity-check decoders (2007)
Zhengya Zhang, Lara Dolecek, Martin Wainwright, Venkat Anantharam, Borivoje Nikolić
Abstract−A class of combinatorial structures, called absorbing sets, strongly influences the performance of low-density paritycheck (LDPC) decoders. In particular, the quantization scheme strongly...
Analysis of absorbing sets for array-based LDPC codes (2007)
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin Wainwright, Borivoje Nikolić
Abstract — Low density parity check codes (LDPC) are known to perform very well under iterative decoding. However, these codes also exhibit a change in the slope of the bit error rate (BER) vs....
Low density codes achieve the ratedistortion bound (2006)
Emin Martinian, Martin Wainwright
Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of analysis...
Zhengya Zhang, Lara Dolecek, Borivoje Nikolić, Venkat Anantharam, Martin Wainwright
Abstract−Several high performance LDPC codes have paritycheck matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any structured LDPC code...
Zhengya Zhang, Lara Dolecek, Borivoje Nikolić, Venkat Anantharam, Martin Wainwright
Abstract−Several high performance LDPC codes have paritycheck matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any structured LDPC code...
Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin Wainwright
Abstract-Several high performance LDPC codes have parity check matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any structured LDPC code in...
Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin Wainwright
Abstract-Several high performance LDPC codes have parity check matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any structured LDPC code in...
Martin Wainwright, Tommi Jaakkola, Alan Willsky
We develop an approach for computing provably exact maximum a posteriori (MAP) configurations for a subclass of problems on graphs with cycles. By decomposing the original problem into a convex...
Emin Martinian, Martin Wainwright
We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of analysis techniques...
Using linear programming to decode linear codes (2003)
Jon Feldman, Martin Wainwright, David R. Karger
Abstract--- Given a linear code and observations from a noisy channel, the decoding problem is to determine the most likely (ML) codeword. We describe a method for approximate ML decoding of an...
Jon Feldman, David R. Karger, Martin Wainwright
In recent work (Feldman and Karger [8]), we introduced a new approach to decoding turbo-like codes based on linear programming (LP). We gave a precise characterization of the noise patterns that...
C ○ 2004 Kluwer Academic Publishers. Manufactured in The Netherlands. (2002)
Martin Wainwright, Tommi Jaakkola, Alan Willsky
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
Martin Wainwright, Tommi Jaakkola, Alan Willsky
Finding the maximum a posteriori (MAP) assignment of a discrete-state distribution speci ed by a graphical model requires solving an integer program. The max-product algorithm, also known as the...
Martin Wainwright, Tommi Jaakkola, Alan Willsky
We present a tree-based reparameterization framework for the approximate estimation of stochastic processes on graphs with cycles. This framework provides a new conceptual view of a large class of...