Serial Schedules for Belief-Propagation: Analysis of Convergence Time

DOI10.1109/TIT.2007.915702zbMATH Open1311.94118MaRDI QIDQ3604495FDOQ3604495

Authors: Jacob Goldberger, Haggai Kfir 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Efficient Serial Message-Passing Schedules for LDPC Decoding
• scientific article
• Parallel versus sequential updating for belief propagation decoding
• Bounds on the performance of belief propagation decoding
• Iterative decoding of LDPC codes: some bounds and properties

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Decoding (94B35)

Cited In (3)

• Parallel versus sequential updating for belief propagation decoding
• Gauging tensor networks with belief propagation
• Efficient Serial Message-Passing Schedules for LDPC Decoding

This page was built for publication: Serial Schedules for Belief-Propagation: Analysis of Convergence Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604495)