Reliability-based high-efficient dynamic schedules for belief propagation decoding of LDPC codes
暂无分享,去创建一个
[1] Luca Fanucci,et al. Layered Decoding of Non-Layered LDPC Codes , 2006, 9th EUROMICRO Conference on Digital System Design (DSD'06).
[2] Hideki Imai,et al. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..
[3] Jun Heo,et al. Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes , 2009, IEEE Communications Letters.
[4] Joseph R. Cavallaro,et al. Optimized Message Passing Schedules for LDPC Decoding , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..
[5] A.I.V. Casado,et al. Improving LDPC Decoders via Informed Dynamic Scheduling , 2007, 2007 IEEE Information Theory Workshop.
[6] Brendan J. Frey,et al. Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..
[7] Simon Litsyn,et al. Efficient Serial Message-Passing Schedules for LDPC Decoding , 2007, IEEE Transactions on Information Theory.
[8] Gerhard Fettweis,et al. Reduced Complexity LDPC Decoding using Forced Convergence , 2004 .
[9] Hong-Yeop Song,et al. Variable-to-Check Residual Belief Propagation for informed dynamic scheduling of LDPC codes , 2008, 2008 International Symposium on Information Theory and Its Applications.
[10] Paul Fortier,et al. Lowering Error Floor of LDPC Codes Using a Joint Row-Column Decoding Algorithm , 2007, 2007 IEEE International Conference on Communications.
[11] Ofer Amrani,et al. Edge-based Scheduled BP in LDPC Codes , 2007, 2007 IEEE International Symposium on Information Theory.