Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm Tomoharu SHIBUYA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2010/11/01 Vol. E93-ANo. 11 ;
pp. 2083-2088 Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications) Category: Coding Theory Keyword: convergence of the sum-product algorithm, factor graph, message-passing, sum-product decoding, LDPC codes,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/10/01 Vol. E91-ANo. 10 ;
pp. 2729-2736 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Coding Theory Keyword: sum-product decoding, BCH codes, Tanner Graph, cycles of length four, soft-in soft-out,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/10/01 Vol. E89-ANo. 10 ;
pp. 2501-2509 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Coding Theory Keyword: low-density parity-check (LDPC) code, burst erasure, sum-product decoding, stopping set,