Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
复制标题
DOI：
10.1587/transfun.e93.a.2083
复制
发表时间：
2010-11
期刊：
影响因子：
--
通讯作者：
T. Shibuya
中科院分区：
文献类型：
--
作者：
T. Shibuya
最近，Mooij等人提出了新的和积算法收敛的充分条件，并且还表明，如果因子图是树，则Mooij收敛的充分条件总是有效的。在这封信中，我们证明了上述陈述的匡威在某些假设下也是正确的，并且该假设对于和积解码也成立。这些新获得的事实意味着，Mooij的充分条件的和积解码的收敛被激活，当且仅当发送的码字的后验概率的因子图是一棵树。
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.