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

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

Serial Concatenation of Binary LDPC Codes with Iterative Decoding

Latifa Mostari, Abdelmalik Taleb Ahmed

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.

International Journal of Recent Engineering ScienceDec 8, 20202 citations

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, Belief Propagation (BP) Probabilistic (Prob), Belief Propagation (BP) Log Simple.

Jan 1, 20150 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 UniversityJan 1, 20050 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.

GlobecomDec 1, 20143 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, 20233 citations

Research on a Fast Decoding Method of the Quasi-cyclic LDPC Codes Based on Serial Message-Passing Schedule

Lei Jing, Yongqiang Gao, Jianhui Wang +1 more

A new fast decoding method of Quasi-Cyclic LDPC(QC-LDPC)codes, named semi-serial decoding algorithm, is presented through contraposing the shortcoming of flood decoding method.For the algorithm, the message was updated in a serial sequence of m subsets of check nodes(or variable nodes), while the check nodes(or variable nodes) in the same subset are updated simultaneously. In this way,the decoding speed would be faster than the common serial decoding algorithm several times. An efficient grouping method suitable for the quasi-cyclic LDPC codes based on the circulant architecture is proposed.Simulation results show that,under the same complexiry,the proposed algorithm fastens the decoding speed of quasi-cyclic LDPC codes, meanwhile, it inherits all the merits of the serial massage-passing decoding algorithm. The conclusion is that the speed of the semi-serial decoding method is at least p times than that of the serial one(p is the number of rows of the cyclic permutation matrix in the parity check matrix of quasi-cyclic LDPC codes).

Jan 1, 20082 citations