Skip to main content
Article thumbnail
Location of Repository

Adaptive methods for linear programming decoding

By Mohammad H. Taghavi N and Paul H. Siegel

Abstract

Abstract—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we make a first step in studying this method, and show that by starting from a simple LP problem and adaptively adding the necessary constraints, the complexity of LP decoding can be significantly reduced. In particular, we observe that with adaptive LP decoding, the sizes of the LP problems that need to be solved become practically independent of the density of the parity-check matrix. We further show that adaptively adding extra constraints, such as constraints based on redundant parity checks, can provide large gains in the performance. Index Terms—Cutting planes, low-density parity-check (LDPC) codes, linear programming (LP), LP decoding, message passing, maximum-likelihood (ML) decoding, pseudocodewords. I

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.415.814
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://cmrr-star.ucsd.edu/star... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.