Title :
On the joint decoding of LDPC codes and finite-state channels via linear programming
Author :
Kim, Byung-Hak ; Pfister, Henry D.
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
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.
Keywords :
binary codes; error statistics; intersymbol interference; linear codes; linear programming; maximum likelihood decoding; parity check codes; LDPC codes; binary linear codes; binary-input finite-state channels; intersymbol interference channel; joint-decoding pseudo-codewords; linear programming; maximum-likelihood certificate property; pairwise error probability; Error analysis; Iterative algorithms; Iterative decoding; Linear code; Linear programming; Maximum likelihood decoding; Pairwise error probability; Parity check codes; Power capacitors; Upper bound;
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
DOI :
10.1109/ISIT.2010.5513614
