Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
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, Mooijs 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 Mooijs 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.
- 2010-11-01
著者
-
Shibuya Tomoharu
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Shibuya Tomoharu
Dep. Of Information And Communication Sciences Sophia Univ.
関連論文
- Encoding of Linear Codes Based on the Rearrangement of Block-Triangularized Parity-Check Matrices
- On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Varieties (Special Section on Information Theory and Its Applications)
- An Improved Bound for the Dimension of Subfield Subcodes
- Multi-edge type LDPC code ensembles with exponentially few codewords of linear small weight (情報理論)
- A note on analytical solution of covariance evolution for regular LDPC codes (情報理論)
- On the Performance of Algebraic Geometric Codes
- A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS
- On the size of circulant matrices for which reversible codes exist (ワイドバンドシステム)
- Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
- Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
- Sufficient conditions for convergence of the sum-product decoding (情報理論)
- On the size of circulant matrices for which reversible codes exist (情報処理)
- Sufficient conditions for convergence of the sum-product decoding (情報セキュリティ)
- On the size of circulant matrices for which reversible codes exist (情報セキュリティ)
- Sufficient conditions for convergence of the sum-product decoding (ワイドバンドシステム)
- Ring Theoretic Approach to Reversible Codes Based on Circulant Matrices
- On the dependence of error performance of spatially coupled LDPC codes on their design parameters
- On the Dependence of Error Performance of Spatially Coupled LDPC Codes on Their Design Parameters