Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Electronics Letters

Early detection of successful decoding for dual-diagonal block-based LDPC codes

Cheng-Hung Lin, M.-K. Ku

Published Nov 5, 2008• 4 citations
Publisher

Abstract

A fast, successful decoding detection mechanism is proposed for dual-diagonal block-based low-density parity-check (LDPC) codes. The algorithm eliminates unnecessary parity check computation by exploiting the structure of dual-diagonal LDPC codes. The average number of decoding iterations can be reduced for both two-phase decoders and layered decoders with no performance degradation on the AWGN channel. Simulation results show that the proposed mechanism reduces average iterations by 10–15% at 10−5 bit error rate compared with standard parity-check equations.

DOI
10.1049/el:20082236

Related papers

An efficient early stopping analog decoder for LDPC codes

Yuan Gao, Yujie Lin, Bowen Zeng +2 more

The analog implementation of error control decoders is a competitive methodology compared with the digital implementation in power efficiency and throughput. In order to detect uncorrectable frames and early stop the iterative decoding of low-density parity check (LDPC) analog decoders, a probability stopping block using probabilities of satisfied checks is proposed. Simulation results show that the proposed criterion can greatly reduce the average number of iterations at low SNR, and has better tradeoff between complexity and performance than other stopping criteria using extrinsic information.

International Conference on Computer Science and Network Technology (ICCSNT)•Dec 1, 2015•1 citation

Analysis of Check-Node Merging Decoding for Punctured LDPC Codes with Dual-Diagonal Parity Structure

Jung-Ae Kim, Sung-Rae Kim, Dong‐Joon Shin +1 more

In this paper, the authors propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC) and AWGN channel, the authors analyze and compare the check-node merging and the conventional erasure decoding schemes of the punctured LDPC codes with dual-diagonal parity structure using density evolution. Analytical results show that the check-node merging decoding gives faster convergence speed for both BEC and AWGN channel. Also, simulation results are provided to confirm the analytical results.

IEEE Wireless Communications and Networking Conference•Jan 1, 2007•4 citations

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jul 1, 2009•1 citation

Low Complexity Stopping Criterion for LDPC Code Decoders

Frank Kienle, Norbert Wehn

Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.

IEEE Vehicular Technology Conference•Dec 10, 2005•67 citations

A Weighted Belief Propagation Decoding Algorithm of LDPC Codes for Fast Convergence and Early Stopping

Tso-Cho Chen

A weighted belief propagation decoding algorithm for low-density parity-check decoding is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. We propose an early stopping criterion which is based on the average weighted reliability measure of the hard output of decoder to detect undecodable blocks in an early stage of the decoding process. In addition, an adaptive weighted iteration scheme is proposed to increase the convergence speed of belief propagation (BP) decoding and therefore improve the error performance. The evolution of the adaptive weighting factor with the number of decoding iterations is based on the relative entropy between two consecutive ”a posteriori” probabilities distribution at decoder output. Simulation results show that the proposed algorithm can achieve about 0.2-0.4 dB coding gain improvement on average while reducing up to about 50%-85% iterations for decoding at low to medium E(subscript b)/ N(subscript 0) , compared with the conventional BP based algorithms.

•Jul 1, 2012•0 citations

Early Termination of BCH Codes Aided Iterative Decoding Algorithm for LDPC

Yongbo Wang

In conventional satellite broadcasting systems,e.g.DVB-S2,the error-correction schemes are often based on the concatenation of BCH and low-density parity-check(LDPC) codes,so as to obtain excellent bit error rate(BER) performance.As the inner codes,LDPC codes are traditionally decoded by iterative algorithms with many iteration cycles.In virtue of the concatenated structure of BCH and LDPC codes,a novel iterative decoding structure involving the embedment of BCH error-check function into each iterative cycle of LDPC is proposed.Computer simulations show that the iteration number of LDPC decoding with the proposed algorithm is obviously smaller than with traditional algorithm,thus greatly lowering the additional complexity of BCH error-check codes.Therefore,the total complexity and latency of the iterative decoding could be sufficiently reduced,while the similar system BER performance is maintained.

•Jan 1, 2011•0 citations
A fast, successful decoding detection mechanism is proposed for dual-diagonal block-based low-density parity-check (LDPC) codes. The algorithm eliminates unnecessary parity check computation by exploiting the structure of dual-diagonal LDPC codes. The average number of decoding iterations can be reduced for both two-phase decoders and layered decoders with no performance degradation on the AWGN channel. Simulation results show that the proposed mechanism reduces average iterations by 10–15% at 10−5 bit error rate compared with standard parity-check equations.
The analog implementation of error control decoders is a competitive methodology compared with the digital implementation in power efficiency and throughput. In order to detect uncorrectable frames and early stop the iterative decoding of low-density parity check (LDPC) analog decoders, a probability stopping block using probabilities of satisfied checks is proposed. Simulation results show that the proposed criterion can greatly reduce the average number of iterations at low SNR, and has better tradeoff between complexity and performance than other stopping criteria using extrinsic information.
In this paper, the authors propose new decoding scheme of punctured LDPC codes with dual-diagonal parity structure by merging check nodes connected to the punctured parity nodes. This check-node merging decoding not only needs smaller number of operations at each iteration but also shows faster decoding convergence speed than the conventional erasure decoding. For the binary erasure channel (BEC) and AWGN channel, the authors analyze and compare the check-node merging and the conventional erasure decoding schemes of the punctured LDPC codes with dual-diagonal parity structure using density evolution. Analytical results show that the check-node merging decoding gives faster convergence speed for both BEC and AWGN channel. Also, simulation results are provided to confirm the analytical results.
Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1
Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.
A weighted belief propagation decoding algorithm for low-density parity-check decoding is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. We propose an early stopping criterion which is based on the average weighted reliability measure of the hard output of decoder to detect undecodable blocks in an early stage of the decoding process. In addition, an adaptive weighted iteration scheme is proposed to increase the convergence speed of belief propagation (BP) decoding and therefore improve the error performance. The evolution of the adaptive weighting factor with the number of decoding iterations is based on the relative entropy between two consecutive ”a posteriori” probabilities distribution at decoder output. Simulation results show that the proposed algorithm can achieve about 0.2-0.4 dB coding gain improvement on average while reducing up to about 50%-85% iterations for decoding at low to medium E(subscript b)/ N(subscript 0) , compared with the conventional BP based algorithms.
In conventional satellite broadcasting systems,e.g.DVB-S2,the error-correction schemes are often based on the concatenation of BCH and low-density parity-check(LDPC) codes,so as to obtain excellent bit error rate(BER) performance.As the inner codes,LDPC codes are traditionally decoded by iterative algorithms with many iteration cycles.In virtue of the concatenated structure of BCH and LDPC codes,a novel iterative decoding structure involving the embedment of BCH error-check function into each iterative cycle of LDPC is proposed.Computer simulations show that the iteration number of LDPC decoding with the proposed algorithm is obviously smaller than with traditional algorithm,thus greatly lowering the additional complexity of BCH error-check codes.Therefore,the total complexity and latency of the iterative decoding could be sufficiently reduced,while the similar system BER performance is maintained.