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

ETRI Journal

Improved Reliability-Based Iterative Decoding of LDPC Codes Based on Dynamic Threshold

Zhuo Ma, Du Shuanyi

Published May 4, 2015• 1 citation
Publisher

Abstract

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

DOI
10.4218/etrij.15.0113.1265

Related papers

Reliability-Based Iterative Decoding of LDPC Codes Using Likelihood Accumulation

Ming Yan Jiang, Chunming Zhao, Enyang Xu +1 more

In this work, we present an improvement on low complexity serial concatenation of belief propagation (BP) - order statistic decoding (OSD) algorithm for low-density parity-check (LDPC) codes. We introduce a more reliable method to reconstruct ordered information sequence in terms of the accumulated log-likelihood ratio (LLR) transitions of variable nodes. We give a general expression for both the existing BP-OSD algorithm and our proposed new method according to a structure similar to an infinite impulse response (IIR) filter. This improved algorithm achieves noticeable performance gains with only modest increase in computation complexity.

IEEE Communications Letters•Aug 1, 2007•40 citations

Reliability-based iterative decoding of LDPC codes using segmented accumulation of likelihood ratio

Dong Zi-jian

In this work, we present an improvement on the belief propagation (BP) algorithm concatenated serially with order statistic decoding (OSD) for low-density parity-check (LDPC) codes. We use the segmented accumulation of log-likelihood ratio (LLR) of variance nodes as the ordered information metric to reconstruct received sequence. This method can reduce the sensitivity of accumulated parameter selection to the fluctuation of performance, and further improve decoding performance.

International Conference on Advanced Computer Theory and Engineering•Aug 1, 2010•1 citation

A serial concatenated scheme for LDPC code to achieve better error correction performance

Zhe Wang, Meng Zhang

Low Density Parity Check(LDPC) Codes is a class of approaching limits error correction codes which has gained widely application in communications. The excellent performance, however, is the result of a large number of repeatedly conducting iterative decoding algorithm, and is apt to be seriously affected by small girth in the parity check matrix. In this paper we present a novel serial concatenated scheme for LDPC codes which utilize much smaller generation matrix and the interleaver to reduce possibilities of girth, thus reducing the number of iterations in decoding. Simulation shows that the new codes have better performance while less requirement of iterations.

International Conference on Consumer Electronics, Communications and Networks (CECNet)•Apr 1, 2012•8 citations

A Hybrid Decoding Scheme for Short Non-Binary LDPC Codes

Marco Baldi, Franco Chiaraluce, Nicola Maturo +2 more

In this paper, an iterative soft-decision hybrid decoding algorithm for non-binary low-density parity-check (LDPC) codes with short codeword lengths is proposed. The rationale of the approach is to combine the classical belief propagation (BP) iterative LDPC decoding algorithm with the most reliable basis (MRB) decoding algorithm. This allows to achieve significant performance improvements, with a complexity that, for medium/low error rates, is only slightly higher than that of the BP algorithm alone. The performance improvement with respect to pure BP decoding is up to 0.7 dB at codeword error rate (CER) ≈ 10-5. Notably, for a fixed MRB order, hybrid decoding achieves a gain up to 0.5 dB at CER ≈ 10-5with respect to BP decoding and MRB decoding used alone.

IEEE Communications Letters•Nov 4, 2014•27 citations

Low-Complexity Check-Node-Based Serial Scheduling Belief Propagation for LDPC Codes

Lenan Wu

Compared to classic channel coding,Low-density parity-check(LDPC) codes have proved to be very powerful channel coding schemes with a broad range of applications.However,as maximum-likelihood decoding is too complex to implement,suboptimal decoders have to be employed.One of the most popular decoding algorithms of LDPC codes is belief propagation(BP) decoding.Informed Dynamic Scheduling(IDS) can provide a better BER performance,but hard to implement due to high computational complexity increased.In order to improve the convergence,a simple low-complexity sequential check-node-based scheduling strategy is proposed.A new check-node-based reliability measure is defined,which represents the degree of reliability approximately.The reliability measure is used for ordering while the actual message updates still use the exact BP equations.During an iteration,the schedule strategy finds an update sequence,which is arranged by the new defined reliability measure in ascending order.Complexity is compared among those algorithms.Mechanism why the new strategy works effective is presented.Simulation shows that the new approach significantly improves the BER performance using short-length block LDPC codes and reduces iterations.

Journal of Signal Processing•Jan 1, 2013•2 citations

Iterative Decoding for the Concatenation of LDPC Codes and BCH Codes Based on Chase Algorithm

Zhiping Shi, Liang Zhou, Hong Wen +1 more

In this paper, an iterative joint decoding algorithm for low density parity check codes with BCH codes based on Chase algorithm is proposed. After a certain number of iterations, the soft output values delivered by belief propagation algorithm of LDPC codes are used as reliability values to perform Chase decoding of BCH codes. And BCH decoder also will return soft information to LDPC decoder as input. This approach presents an option scheme for LDPC with medium length because of the relevant presence of short loops. It allows to bridge the gap between error performance and maximum likelihood decoding. Simulation result for the scheme is given.

International Conference on ITS Telecommunications•Jun 1, 2006•2 citations
A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.
In this work, we present an improvement on low complexity serial concatenation of belief propagation (BP) - order statistic decoding (OSD) algorithm for low-density parity-check (LDPC) codes. We introduce a more reliable method to reconstruct ordered information sequence in terms of the accumulated log-likelihood ratio (LLR) transitions of variable nodes. We give a general expression for both the existing BP-OSD algorithm and our proposed new method according to a structure similar to an infinite impulse response (IIR) filter. This improved algorithm achieves noticeable performance gains with only modest increase in computation complexity.
Low Density Parity Check(LDPC) Codes is a class of approaching limits error correction codes which has gained widely application in communications. The excellent performance, however, is the result of a large number of repeatedly conducting iterative decoding algorithm, and is apt to be seriously affected by small girth in the parity check matrix. In this paper we present a novel serial concatenated scheme for LDPC codes which utilize much smaller generation matrix and the interleaver to reduce possibilities of girth, thus reducing the number of iterations in decoding. Simulation shows that the new codes have better performance while less requirement of iterations.
In this paper, an iterative soft-decision hybrid decoding algorithm for non-binary low-density parity-check (LDPC) codes with short codeword lengths is proposed. The rationale of the approach is to combine the classical belief propagation (BP) iterative LDPC decoding algorithm with the most reliable basis (MRB) decoding algorithm. This allows to achieve significant performance improvements, with a complexity that, for medium/low error rates, is only slightly higher than that of the BP algorithm alone. The performance improvement with respect to pure BP decoding is up to 0.7 dB at codeword error rate (CER) ≈ 10-5. Notably, for a fixed MRB order, hybrid decoding achieves a gain up to 0.5 dB at CER ≈ 10-5with respect to BP decoding and MRB decoding used alone.
Compared to classic channel coding,Low-density parity-check(LDPC) codes have proved to be very powerful channel coding schemes with a broad range of applications.However,as maximum-likelihood decoding is too complex to implement,suboptimal decoders have to be employed.One of the most popular decoding algorithms of LDPC codes is belief propagation(BP) decoding.Informed Dynamic Scheduling(IDS) can provide a better BER performance,but hard to implement due to high computational complexity increased.In order to improve the convergence,a simple low-complexity sequential check-node-based scheduling strategy is proposed.A new check-node-based reliability measure is defined,which represents the degree of reliability approximately.The reliability measure is used for ordering while the actual message updates still use the exact BP equations.During an iteration,the schedule strategy finds an update sequence,which is arranged by the new defined reliability measure in ascending order.Complexity is compared among those algorithms.Mechanism why the new strategy works effective is presented.Simulation shows that the new approach significantly improves the BER performance using short-length block LDPC codes and reduces iterations.
In this paper, an iterative joint decoding algorithm for low density parity check codes with BCH codes based on Chase algorithm is proposed. After a certain number of iterations, the soft output values delivered by belief propagation algorithm of LDPC codes are used as reliability values to perform Chase decoding of BCH codes. And BCH decoder also will return soft information to LDPC decoder as input. This approach presents an option scheme for LDPC with medium length because of the relevant presence of short loops. It allows to bridge the gap between error performance and maximum likelihood decoding. Simulation result for the scheme is given.