Relative-Residual-based Dynamic Schedule for Belief Propagation decoding of LDPC codes

China Communications

Volumn 8, Issue 5, 2011, Pages 47-53

  Jie, Huang ^a   Zhang, Lijun ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

BP; Dynamic schedule; Greediness; Ldpc codes; Relative residual

Indexed keywords

EID: 81255146923     PISSN: 16735447     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. LIU Jing, XU Yong. Reduced Complexity and Improved Performance for Short Regular LDPC Codes Based on Select Updating Schedule[J]. IEEE Communications Letters, 2007, 13(5): 414-416.
2. LEVIN D, SHARON E, LITSYN S. Lazy Scheduling for LDPC Decoding[J], IEEE Transactions on Information Theory, 2007, 45(3): 399-431.
3. KSCHSCHANG F R, FREY B J. Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models [J]. IEEE J Sel Areas Commun, 1998, 16(4): 219-230.
4. ROVINI M, et al. Layered Decoding of Non-layered LDPC Codes[C]// Proceeding of 9th EUROMICRO Conf on Digital System Design: June 9-10, 2006, Budapest, Hungary.
5. SHARON E, UTSYN S, GOLDBERGER J.Efficient Serial Message-passing Schedule for LDPC Decoding [J]. IEEE Trans Inform Theory, 2007, 53(6): 4076-4091.
6. GOLOV O, AMRANI O. Edge-based Scheduled BP in LDPC Codes[C]// Proceedings of International Symposium on Information Theory, June 24-29, 2007, Nice, France.
7. KIM S, KO K, HEO J. Two-Staged Informed Dynamic Scheduling for Sequential Belief Propagation Decoding of LDPC Codes [J]. IEEE Communications Letters, 2009, 13 (3): 193-195.
8. CASADO A I V, GRIOT M, WESEL R D. Improving LDPC Decoders via Informed Dynamic Scheduling [C]// Proceedings of IEEE Information Theory Workshop 2007, Sep. 2-6, 2007, Lake Tahoe, CA, USA
9. CASADO V. Improving LPDC Decoders: Informed Dynamic Message-Passing Scheduling and Multiple-Rate Code design [D]. UCLA, 2007.
10. CASADO A I V, GRIOT M, WESEL R D. Overcoming LDPC Trapping Sets with Informed Scheduling for Belief Propagation Decoding of LDPC Codes[C]// Proceedings of Information Theory and Apllications Workshop USCD, Nov 18-22, 2007, USCD, USA.
11. ELIDAN G, MCGRAW I, KOLLER D. Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing[C]// Proceedings of 22nd Conference on Uncertainty in Artificial Intelligence, July 5-9, 2006, Cambridge, MA, USA.
12. KIM J H, NAM M Y, SONG H Y. Variable-to-check Residual Belief Propagation for LDPC Codes[J]. IEEE Electronics Letters, 2009, 45(2): 117-118.
13. RADOSAVUEVIC P, BAYNAST A, CAVALLARO J R. Optimized Message Passing Schedules for LDPC Decoding [C]// Proceedings of 39th Asilomar Conf on Signals, Systems and Computers, 2005, Pacific Grove, CA, USA.
14. HE Zheng, ROY S, FORTIER P. Lowering Error Floor of LDPC Codes Using a Joint Row-column Decoding Algorithmi[C]// Proceedings of ICC-2007, June 24-28, 2007, Glasgow, Scotland.
15. ZIMMERMANN E, et al. Reduced Complexity LDPC Decoding Using Forced Convergence[C]// Proceedings of International Symposium Wireless Personal Multimedia Communications, Sep. 12-15, 2004, Abano Terme, Italy.
16. RYAN E W, UN Shu. Channel Codes: Classical and Modern [M]. Cambridge, New York, USA: Cambridge University Press, 2009.
17. SONG Zixi. LDPC Codes Based on Circular Permutation Matrix[D]. Beijing: Beijing Jiaotong University, 2011.