Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. These newly obtained fact implies that Mooij's sufficient condition for convergence of the sum-product decoding is activated if and only if the factor graph of the a posteriori probability of the transmitted codeword is a tree.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tomoharu SHIBUYA, "Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 2083-2088, November 2010, doi: 10.1587/transfun.E93.A.2083.
Abstract: Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. These newly obtained fact implies that Mooij's sufficient condition for convergence of the sum-product decoding is activated if and only if the factor graph of the a posteriori probability of the transmitted codeword is a tree.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.2083/_p
Copy
@ARTICLE{e93-a_11_2083,
author={Tomoharu SHIBUYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm},
year={2010},
volume={E93-A},
number={11},
pages={2083-2088},
abstract={Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. These newly obtained fact implies that Mooij's sufficient condition for convergence of the sum-product decoding is activated if and only if the factor graph of the a posteriori probability of the transmitted codeword is a tree.},
keywords={},
doi={10.1587/transfun.E93.A.2083},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2083
EP - 2088
AU - Tomoharu SHIBUYA
PY - 2010
DO - 10.1587/transfun.E93.A.2083
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
AB - Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. These newly obtained fact implies that Mooij's sufficient condition for convergence of the sum-product decoding is activated if and only if the factor graph of the a posteriori probability of the transmitted codeword is a tree.
ER -