Efficient Serial Message-Passing Schedules for LDPC Decoding

DOI10.1109/TIT.2007.907507MaRDI QIDQ3548918zbMATH OpenOpenAlexFDO

Authors Jacob Goldberger, Eran Sharon, Simon Litsyn

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2007.907507

Mathematics Subject Classification ID

Network protocols (68M12) Decoding (94B35) Bounds on codes (94B65)

Recommendations

• Serial Schedules for Belief-Propagation: Analysis of Convergence Time
• scientific article; zbMATH DE number 5079406
• On Designing Good LDPC Codes for Markov Channels
• Iterative decoding of LDPC codes: some bounds and properties
• Efficient encoding of low-density parity-check codes

Cited in

(8)

• An asymptotic distribution theory for Eulerian recurrences with applications
• scientific article; zbMATH DE number 5079406 (Why is no real title available?)
• Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes
• Serial Schedules for Belief-Propagation: Analysis of Convergence Time
• Weighted-bit-flipping-based sequential scheduling decoding algorithms for LDPC codes
• Recursive descriptions of polar codes
• Message passing algorithms and improved LP decoding
• Reducing the complexity of the layer scheduled LDPC decoder based on the information bottleneck method

This page was built for publication: Efficient Serial Message-Passing Schedules for LDPC Decoding

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