Probability stopping criterion for analog decoding of LDPC codes

https://doi.org/10.1016/S1005-8885(17)60185-7Get rights and content

Abstract

To detect uncorrectable frames and terminate the decoding procedure early, a probability stopping criterion for iterative analog decoding of low density parity check (LDPC) codes is proposed in this paper. By using probabilities of satisfied checks to detect uncorrectable frames and terminate decoding, the proposed criterion could be applied to analog decoders without much structure modifications. Simulation results show that the proposed criterion can reduce the average number of iterations and achieve a better balance in bit error ratio (BER) performance and decoding complexity than other stopping criteria using extrinsic information.

References (12)

  • R G Gallager
  • D J C MacKay et al.

    Near Shannon limit performance of low density parity check codes

    Electronics Letters

    (1996)
  • D Shin et al.

    A stopping criterion for low-density parity-check codes

  • G J Han et al.

    A unified early stopping criterion for binary and nonbinary LDPC codes based on check-sum variation patterns

    IEEE Communications Letters

    (2010)
  • X J Xu et al.

    A low-complexity stopping criterion for the decoder of parallel concatenated LDPC

  • C H Lin et al.

    Efficient layer stopping technique for layered LDPC decoding

    Electronics Letters

    (2013)
There are more references available in the full text version of this article.

Cited by (2)

View full text
Copyright © 2017 The Journal of China Universities of Posts and Telecommunications. Published by Elsevier B.V. All rights reserved.