Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm

• SHIBUYA Tomoharu

  Department of Information and Communication Sciences, Sophia University

抄録

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.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E93-A (11), 2083-2088, 2010

  一般社団法人 電子情報通信学会

キーワード

• convergence of the sum-product algorithm
• factor graph
• message-passing
• sum-product decoding
• LDPC codes

詳細情報

• CRID: 1390282681288517760
• NII論文ID: 10027984787
• NII書誌ID: AA10826239
• DOI: 10.1587/transfun.e93.a.2083
• ISSN: 17451337
• ISSN: 09168508
• Web Site: http://digital-archives.sophia.ac.jp/repository/view/repository/00000032346
• Web Site: http://www.jstage.jst.go.jp/article/transfun/E93.A/11/E93.A_11_2083/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • IRDB
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可