A Caltech Library Service

Iterative weighted ℓ_1 Optimization for compressed sensing and coding

Khajehnejad, M. Amin and Dimakis, Alexandros G. and Hassibi, Babak (2010) Iterative weighted ℓ_1 Optimization for compressed sensing and coding. In: Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2010. IEEE , Piscataway, NJ, pp. 768-774. ISBN 978-1-4244-9722-5.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We introduce a novel algorithm for decoding binary linear codes by linear programming. We build on the LP decoding algorithm of Feldman et al. and introduce a post-processing step that solves a second linear program that reweights the objective function based on the outcome of the original LP decoder output. Our analysis shows that for some LDPC ensembles we can improve the provable threshold guarantees compared to standard LP decoding. We also show significant empirical performance gains for the reweighted LP decoding algorithm with very small additional computational complexity.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:©2010 IEEE. This work was supported in part by the National Science Foundation under grants CCF-0729203, CNS-0932428 and CCF-1018927, by the Office of Naval Research under the MURI grant N00014-08-1-0747 and by Caltech’s Lee Center for Advanced Networking.
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-08-1-0747
Caltech’s Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20150224-074009355
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:55134
Deposited By: Shirley Slattery
Deposited On:25 Feb 2015 00:50
Last Modified:03 Oct 2019 08:03

Repository Staff Only: item control page