Skip Navigation

IEICE Transactions on Communications 2008 E91-B(4):1145-1148; doi:10.1093/ietcom/e91-b.4.1145
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
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

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).

Reference

[1] J. Ha, J. Kim, D. Klinc, and S.W. McLaughlin, "Rate-compatible punctured low-density parity-check codes with short block lengths," IEEE Trans. Inf. Theory, vol.52, no.2, pp.728–738, Feb. 2006.

[2] S.B. Wicker, Error Control Systems for Digital Communications and Storage, Prentice Hall, Upper Saddle River, New Jersey, 1995.

[3] F. Kienle and N. Wehn, "Low complexity stopping criterion for LDPC code decoders," Proc. IEEE VTC 2005-Spring, pp.606–609, Stockholm, Sweden, June 2005.

[4] 3GPP, R1-061019, ZTE, "Structured LDPC coding with rate matching," TSG RAN1#44bis, March 2006.

[5] J. Chen and M.P.C. Possorier, "Near optimum universal belief propagation based decoding of low-density parity check codes," IEEE Trans. Commun., vol.50, no.3, pp.406–414, March 2002.

[6] S.-Y. Chung, T.J. Richardson, and R.L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol.47, no.2, pp.657–670, Feb. 2001.


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



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
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?