Math @ Duke

Publications [#319372] of Henry Pfister
Papers Published
 Kim, BH; Pfister, HD, On the joint decoding of LDPC codes and finitestate channels via linear programming,
IEEE International Symposium on Information Theory  Proceedings
(August, 2010),
pp. 754758, ISBN 9781424469604 [doi]
(last updated on 2018/02/19)
Abstract: In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to jointdecoding of binaryinput finitestate channels. In particular, we provide a rigorous definition of LP jointdecoding pseudocodewords (JDPCWs) that enables evaluation of the pairwise error probability between codewords and JDPCWs. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finitestate intersymbol interference channel, then the LP joint decoder also has the maximumlikelihood (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 JDPCWs. © 2010 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

