Math @ Duke

Publications [#319332] of Henry Pfister
Papers Published
 Pfister, HD; Vontobel, PO, On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes,
Ieee International Symposium on Information Theory Proceedings
(December, 2013),
pp. 30003004, IEEE, ISBN 9781479904464 [doi]
(last updated on 2019/07/17)
Abstract: For an arbitrary binary cycle code, we show that sumproduct algorithm (SPA) decoding after infinitely many iterations equals symbolwise graphcover decoding. We do this by characterizing the Bethe free energy function of the underlying normal factor graph (NFG) and by stating a global convergence proof of the SPA. We also show that the set of loglikelihood ratio vectors for which the SPA converges to the allzero codeword is given by the region of convergence of the edge zeta function associated with the underlying NFG. The results in this paper justify the use of graphcover pseudocodewords and edge zeta functions to characterize the behavior of SPA decoding of cycle codes. These results have also implications for the analysis of attenuated sumproduct and maxproduct algorithm decoding of lowdensity paritycheck (LDPC) codes beyond cycle codes. © 2013 IEEE.


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

