On the joint decoding of LDPC codes and finite-state channels via linear programming


Conference Paper

In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to joint-decoding of binary-input finite-state channels. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the LP joint decoder also has the maximum-likelihood (ML) certificate property and all integer valued solutions are codewords. In this case, the performance loss relative to ML decoding can be explained completely by fractional valued JD-PCWs. © 2010 IEEE.

Full Text

Duke Authors

Cited Authors

  • Kim, BH; Pfister, HD

Published Date

  • August 23, 2010

Published In

  • Ieee International Symposium on Information Theory Proceedings

Start / End Page

  • 754 - 758

International Standard Book Number 13 (ISBN-13)

  • 9781424469604

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2010.5513614

Citation Source

  • Scopus