Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#319325] of Henry Pfister

Papers Published

  1. Jian, YY; Pfister, HD, Convergence of weighted min-sum decoding via dynamic programming on trees, Ieee Transactions on Information Theory, vol. 60 no. 2 (January, 2014), pp. 943-963, Institute of Electrical and Electronics Engineers (IEEE) [doi]
    (last updated on 2019/07/18)

    Applying the max-product (and sum-product) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understanding of the conditions required for convergence or optimality of converged solutions or both. This paper presents an analysis of both attenuated max-product decoding and weighted min-sum decoding for low-density paritycheck (LDPC) codes, which guarantees convergence to a fixed point when a weight factor, β is sufficiently small. It also shows that, if the fixed point satisfies some consistency conditions, then it must be both a linear-programming (LP) and maximumlikelihood (ML) decoding solution. For (dv, dc)-regular LDPC codes, the weight factor must satisfy.©2013 IEEE.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320