Published October 2010
| Version Published + Submitted
Book Section - Chapter
Open
Reweighted LP decoding for LDPC codes
-
1.
California Institute of Technology
-
2.
University of Southern California
Abstract
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.
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, by Caltech's Lee Center for Advanced Networking and by DARPA FA8750-07-C-0231.Attached Files
Published - 05706905.pdf
Submitted - 1103.2837.pdf
Files
05706905.pdf
Additional details
Identifiers
- Eprint ID
- 75123
- Resolver ID
- CaltechAUTHORS:20170314-164934408
Related works
- Describes
- https://arxiv.org/abs/1103.2837 (URL)
Funding
- NSF
- CCF-0729203
- NSF
- CNS-0932428
- NSF
- CCF-1018927
- Office of Naval Research (ONR)
- N00014-08-1-0747
- Caltech Lee Center for Advanced Networking
- Defense Advanced Research Projects Agency (DARPA)
- FA8750-07-C-0231
Dates
- Created
-
2017-03-16Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field