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