2011Unpublished venueRequires access

An Adaptive Algorithm and Stopping Criterion for LDPC Decoding

Tso-Cho Chen

Open publisher page 0 citations

Abstract

A new adaptive and early stopping scheme for low-density parity-check (LDPC) decoding is proposed for accelerating the convergence of message-passing algorithms. The new algorithm is based on the cross-entropy between two consecutive a posteriori probabilities distribution of the soft output of decoder. Information-theoretic support and extensive simulations are provided to demonstrate the efficiency of the proposed adaptive algorithm and early stopping criterion. The proposed scheme can significantly reduce the average number of iterations of decoder while having a comparable or even better performance than conventional message-passing algorithms.

About this research paper

What this paper is about

A new adaptive and early stopping scheme for low-density parity-check (LDPC) decoding is proposed for accelerating the convergence of message-passing algorithms. The new algorithm is based on the cross-entropy between two consecutive a posteriori probabilities distribution of the soft output of decoder. Information-theoretic support and extensive simulations are provided to demonstrate the efficiency of the proposed adaptive algorithm and early stopping criterion. The proposed scheme can significantly reduce the average number of iterations of decoder while having a comparable or even better performance than conventional message-passing algorithms.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A new adaptive and early stopping scheme for low-density parity-check (LDPC) decoding is proposed for accelerating the convergence of message-passing algorithms. The new algorithm is based on the cross-entropy between two consecutive a posteriori probabilities distribution of the soft output of decoder. Information-theoretic support and extensive simulations are provided to demonstrate the efficiency of the proposed adaptive algorithm and early stopping criterion. The proposed scheme can significantly reduce the average number of iterations of decoder while having a comparable or even better performance than conventional message-passing algorithms.

Key concepts: Low-density parity-check code, Decoding methods, Algorithm, Message passing, Computer science, A priori and a posteriori, Convergence (economics), Entropy (arrow of time)

Related papers

Back to paper searchBrowse research topicsOriginal source
An Adaptive Algorithm and Stopping Criterion for LDPC Decoding — Research Paper | ScholarLens