Sciweavers

34 search results - page 5 / 7
» Interior-Point Algorithms for Linear-Programming Decoding
Sort
View
ICASSP
2008
IEEE
14 years 1 months ago
Decoding real-field codes by an iterative Expectation-Maximization (EM) algorithm
In this paper, a new approach for decoding real-field codes based on finding sparse solutions of underdetermined linear systems is proposed. This algorithm iteratively estimates...
Hadi Zayyani, Massoud Babaie-Zadeh, Christian Jutt...
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 7 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
INFOCOM
2007
IEEE
14 years 1 months ago
Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 7 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
DCC
2004
IEEE
14 years 7 months ago
On Some New Approaches to Practical Slepian-Wolf Compression Inspired by Channel Coding
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
Anna H. Lee, Michelle Effros, Muriel Médard...