Skip Navigation

IEICE Transactions on Communications 2008 E91-B(4):1145-1148; doi:10.1093/ietcom/e91-b.4.1145
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by SHIN, D.
Right arrow Articles by LEE, H.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Fundamental Theories for Communications

A Stopping Criterion for Low-Density Parity-Check Codes*

Donghyuk SHIN1, Jeongseok HA1, Kyoungwoo HEO1 and Hyuckjae LEE1

1 The authors are with the School of Engineering, Information and Communications University, 119 Munjiro Yuseong-gu Daejeon 305-732, Korea. E-mail: hkw06{at}icu.ac.kr


  Abstract

We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.

Key Words: LDPC codes, belief propagation, stopping criterion

Manuscript received August 23, 2007. Manuscript revised December 10, 2007.

* This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (KRF-2007-D00282).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.