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

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

Published Apr 3, 2006• 4 citations
OpenAlex

Abstract

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.

Related papers

TECHNOLOGY IMPLEMENTATION OF DIFFERENT DECODING TECHNIQUES FOR QUASI CYCLIC LOW DENSITY PARITY CHECK CODES (QC-LDPC)

Geeta Arora

This paper presents a different decoding techniques for Quasi-Cyclic (QC) Low Density Parity Check (LDPC) code. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The encoding and decoding processes of these codes are easy to simplify and implement. The algorithm used for encoding and decoding are based on matrices and implemented on MATLAB for simulation results. In this paper decoding technique QC-LDPC is introduced and compare the performance of LDPC and QC-LDPC. The decoding techniques is conducted by different algorithms such as Bit Flipping (BF), Belief Propagation (BP) Log,

•Jan 1, 2015•0 citations

A fast convergence decoding algorithm for LDPC codes

Xinmei Wang

A realization of belief propagation algorithms based on the two-way schedule and a serial concatenated decoding algorithm for LDPC codes based on the matrix decomposition are presented. The performance of this new algorithm is systematically analyzed via the density evolution theory. Analysis and simulation results show that the serial concatenated decoding algorithm demonstrates a higher convergence speed and has as good performance as the conventional belief propagation algorithm.

Journal of Xidian University•Jan 1, 2005•0 citations

A merry-go-round decoding scheme for non-binary quasi-cyclic LDPC codes

Keke Liu, Juane Li, Shu Lin +1 more

This paper presents a reduced-complexity iterative scheme and an algorithm for decoding non-binary quasi-cyclic (QC) LDPC codes of a specific type. The proposed decoding scheme and the algorithm together significantly reduce the hardware implementation complexity of a decoder with no performance degradation. Also presented in the paper is a simple method for constructing a class of non-binary QC-LDPC codes.

Globecom•Dec 1, 2014•3 citations

On the Serial Concatenation of LDPC Codes

Fedor I. Ivanov, Aleksey Kuvshinov

Concatenated codes are effectively used in different approaches of error-correcting theory. We suggest new concatenated code construction that is composed of outer LDPC code and a particular designed inner LDPC code. Special optimization procedure was developed to obtain inner code with specific error-correcting characteristics. We apply the decoder of woven codes to this construction, while reducing the complexity of decoding procedure compared to a classic decoder of LDPC code. Furthermore, we improve the performance of our scheme with puncturing the code symbols. The resulting concatenated construction outperforms low-rate LDPC from the 5G standard. Besides this, we demonstrate the performance of code with a special parity-check matrix consisting of parity-check matrices of inner and outer codes from our suggested construction.

International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS)•Oct 25, 2023•3 citations

A New Structure LDPC Codes Improved of QC-LDPC Codes

Wenjiang Hu

Low-Density Parity-Check(LDPC) code is a good linear block codes,which performs at a rate extremely close to Shannon capacity.Quasi-cyclic(QC) LDPC form an important subclass of LDPC codes.In this paper,we present an improved structure of QC-LDPC codes.It is shown that the performance of the improved code is even better than QC-LDPC codes in moderate and long frame length.And because of its structure,the encoding implemention is more suitable than QC-LDPC codes.

World Sci-tech R & D•Jan 1, 2008•0 citations

(3, L) quasi-cyclic LDPC codes: Simplified exhaustive search and designs

Cheng Sun, Hengzhou Xu, Dan Feng +1 more

There exist lots of (3, L)-regular quasi-cyclic (QC) LDPC codes constructed from finite fields, protographs, array codes, and computer search under some design rules. For a given code length and rate, how to select the best one from these codes is considerable. In this paper, we study (3, L)-regular QC LDPC codes from the perspective of graph isomorphism, and non-isomorphic (3, L)-regular QC LDPC codes are determined. By analyzing the cycle structures of the resulting non-isomorphic codes, an efficient algorithm for counting cycles is presented. Also proposed is a simplified exhaustive search of non-isomorphic (3, L)-regular QC LDPC codes free of cycles of length less than g0, where g0is the estimated optimal girth value for a given code length. Based on these two algorithms, we can easily construct a (3, L)-regular QC LDPC code with optimized cycle distribution for a given L and code length. Numerical results show that the constructed codes have better performance under the iterative decoding algorithms.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2016•10 citations
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.
This paper presents a different decoding techniques for Quasi-Cyclic (QC) Low Density Parity Check (LDPC) code. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The encoding and decoding processes of these codes are easy to simplify and implement. The algorithm used for encoding and decoding are based on matrices and implemented on MATLAB for simulation results. In this paper decoding technique QC-LDPC is introduced and compare the performance of LDPC and QC-LDPC. The decoding techniques is conducted by different algorithms such as Bit Flipping (BF), Belief Propagation (BP) Log,
Concatenated codes are effectively used in different approaches of error-correcting theory. We suggest new concatenated code construction that is composed of outer LDPC code and a particular designed inner LDPC code. Special optimization procedure was developed to obtain inner code with specific error-correcting characteristics. We apply the decoder of woven codes to this construction, while reducing the complexity of decoding procedure compared to a classic decoder of LDPC code. Furthermore, we improve the performance of our scheme with puncturing the code symbols. The resulting concatenated construction outperforms low-rate LDPC from the 5G standard. Besides this, we demonstrate the performance of code with a special parity-check matrix consisting of parity-check matrices of inner and outer codes from our suggested construction.
There exist lots of (3, L)-regular quasi-cyclic (QC) LDPC codes constructed from finite fields, protographs, array codes, and computer search under some design rules. For a given code length and rate, how to select the best one from these codes is considerable. In this paper, we study (3, L)-regular QC LDPC codes from the perspective of graph isomorphism, and non-isomorphic (3, L)-regular QC LDPC codes are determined. By analyzing the cycle structures of the resulting non-isomorphic codes, an efficient algorithm for counting cycles is presented. Also proposed is a simplified exhaustive search of non-isomorphic (3, L)-regular QC LDPC codes free of cycles of length less than g0, where g0is the estimated optimal girth value for a given code length. Based on these two algorithms, we can easily construct a (3, L)-regular QC LDPC code with optimized cycle distribution for a given L and code length. Numerical results show that the constructed codes have better performance under the iterative decoding algorithms.