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

International Journal of Recent Engineering Science

Serial Concatenation of Binary LDPC Codes with Iterative Decoding

Latifa Mostari, Abdelmalik Taleb Ahmed

Published Dec 8, 2020• 2 citations
Publisher

Abstract

In this paper, a binary serial turbo LDPC code is presented. It represents a serial concatenated LDPC codes separated by interleavers, with iterative decoding. In this work, we aim to investigate the performance evaluation of concatenated code, with reduced complexity and decoding delay, associated with high order constellation using Gray mapping, over Gaussian and Rayleigh channels. Simulation results show that the performance of a serial concatenated LDPC codes is higher than that of single LDPC code with the same code rate and code block length.

DOI
10.14445/23497157/ijres-v6i6p102

Related papers

High performance short-block binary regular LDPC codes

Latifa Mostari, Abdelmalik Taleb Ahmed

LDPC code shows a good performance with long-block codes. However, certain channels are constrained to use short-block codes due to latency. Therefore, concatenated LDPC codes with iterative decoding is a good choice to get a good performance. Concatenated binary LDPC codes were introduced as a class of concatenated codes in which the LDPC codes are irregular codes having different parameters. Although irregular LDPC codes are more efficient than regular codes, irregular LDPC codes have an error floor and a higher encoding complexity than regular code. In this paper, in order to get a good performance/complexity trade-off with a short-block code, we investigate a parallel concatenation of two identical regular binary LDPC codes, using an interleaver. Simulation results show that the proposed code outperforms a single LDPC code. The proposed code needs less time decoding delay than a single LDPC code with the same iteration number. Also, the proposed code needs a less number of iterations to achieve the same performance of a single LDPC code that leads to less decoding complexity and decoding delay. A simplified algorithm, the min-sum algorithm, that is used to decode the component codes shows a small performance loss with respect to the sum-product algorithm.

Alexandria Engineering Journal•Nov 15, 2018•17 citations

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•6 citations

Design and Decoding of a Serial Concatenated Code Structure based on Quasi-Cyclic LDPC Codes

Jean‐Baptiste Doré, Marie‐Hélène Hamon, Pierre Penard

In this paper, we introduce a new serially concatenated code structure, based on Quasi-Cyclic (QC) codes. This structure can be viewed as LDPC codes, and benefits from the advantages of structured QC LDPC codes: simple characterization, good performance for moderate code length and efficient implementation. These codes enable different types of decoding algorithms, from classical Belief Propagation to Turbo-Like decoding algorithms. A joint analysis, in terms of complexity, convergence and performance, has been performed to determine the best decoding choice.

•Apr 3, 2006•4 citations

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

Zhuo Ma, Du Shuanyi

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.

ETRI Journal•May 4, 2015•1 citation

Serial Concatenate LDPC Codes

Shuiqing Li

This paper mainly discusses the design of a family of irregular LDPC codes with low encoding complexity. This class of LDPC codes concatenates multiple single bit parity check block codes in serial, and it makes encoding complexity much lower than in usual ways. Furthermore, using a AWGN channel, it demonstrates that this class of LDPC codes have very good decoding performance.

Journal of Information Engineering University•Jan 1, 2004•0 citations

Serial concatenation of reed muller and LDPC codes with low error floor

Xin Wei Xiao, Mona Nasseri, Bane V. Vasic +1 more

In this paper, we propose a concatenated coding scheme involving an outer Reed-Muller (RM) code and an inner Finite Field low-density parity check (LDPC) code of medium length and high rate. It lowers the error floor of inner Finite Field LDPC code. This concatenation scheme offers flexibility in design and it is easy to implement. In addition, the decoding works in a serial turbo manner and has no harmful trapping sets of size smaller than the minimum distance of the outer code. The simulation results indicate that the proposed serial concatenation can eliminate the dominant trapping sets of the inner Finite Field LDPC code.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2017•1 citation
In this paper, a binary serial turbo LDPC code is presented. It represents a serial concatenated LDPC codes separated by interleavers, with iterative decoding. In this work, we aim to investigate the performance evaluation of concatenated code, with reduced complexity and decoding delay, associated with high order constellation using Gray mapping, over Gaussian and Rayleigh channels. Simulation results show that the performance of a serial concatenated LDPC codes is higher than that of single LDPC code with the same code rate and code block length.
LDPC code shows a good performance with long-block codes. However, certain channels are constrained to use short-block codes due to latency. Therefore, concatenated LDPC codes with iterative decoding is a good choice to get a good performance. Concatenated binary LDPC codes were introduced as a class of concatenated codes in which the LDPC codes are irregular codes having different parameters. Although irregular LDPC codes are more efficient than regular codes, irregular LDPC codes have an error floor and a higher encoding complexity than regular code. In this paper, in order to get a good performance/complexity trade-off with a short-block code, we investigate a parallel concatenation of two identical regular binary LDPC codes, using an interleaver. Simulation results show that the proposed code outperforms a single LDPC code. The proposed code needs less time decoding delay than a single LDPC code with the same iteration number. Also, the proposed code needs a less number of iterations to achieve the same performance of a single LDPC code that leads to less decoding complexity and decoding delay. A simplified algorithm, the min-sum algorithm, that is used to decode the component codes shows a small performance loss with respect to the sum-product algorithm.
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, we introduce a new serially concatenated code structure, based on Quasi-Cyclic (QC) codes. This structure can be viewed as LDPC codes, and benefits from the advantages of structured QC LDPC codes: simple characterization, good performance for moderate code length and efficient implementation. These codes enable different types of decoding algorithms, from classical Belief Propagation to Turbo-Like decoding algorithms. A joint analysis, in terms of complexity, convergence and performance, has been performed to determine the best decoding choice.
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 paper, we propose a concatenated coding scheme involving an outer Reed-Muller (RM) code and an inner Finite Field low-density parity check (LDPC) code of medium length and high rate. It lowers the error floor of inner Finite Field LDPC code. This concatenation scheme offers flexibility in design and it is easy to implement. In addition, the decoding works in a serial turbo manner and has no harmful trapping sets of size smaller than the minimum distance of the outer code. The simulation results indicate that the proposed serial concatenation can eliminate the dominant trapping sets of the inner Finite Field LDPC code.