On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming
Abstract
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.
Cite
@article{arxiv.1005.0052,
title = {On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming},
author = {Byung-Hak Kim and Henry D. Pfister},
journal= {arXiv preprint arXiv:1005.0052},
year = {2010}
}
Comments
To appear in Proc. 2010 IEEE Int. Symp. Information Theory, Ausin, TX, June 12-18, 2010 (a small error in the reference corrected)