IEEE Aerospace Conference (AERO)

Quasi-Cyclic LDPC Codes for Short Block-Lengths

Muhammad Nauman Danish, Syed Ahmed Pasha, Ali Javed Hashmi

Published Mar 6, 2021• 6 citations

Abstract

In wireless communication, transmission error can be caused by multi-path fading, shadowing, scattering, interference and noise. As a result, errors generated in digital communication can be classified as burst errors, random bit errors, crosstalk and echo. For reliable communication, channel coding is used which adds redundancy to the information bits. Reliable and low latency communication are crucial for future communication systems involving satellite constellations and 5G communication systems, which underscores the importance of channel coding. Various codes exist for channel coding, among which low-density parity-check (LDPC) codes, polar codes and tail biting convolution codes are mentioned for 5G ultra-reliable low latency communication and enhanced mobile broadband systems. In the literature, the performance of large block-length codes has been well-studied. But these codes lead to high latency. The design of short block-length codes remains an open problem due to the trade-off between latency and performance. In this paper, we develop a systematic procedure for construction of hybrid quasi-cyclic LDPC (QC-LDPC) codes and compare the performance of the proposed approach with random LDPC and existing QC-LDPC codes for short block-lengths and phase shift keying (PSK) signal characteristics. The proposed method exploits Euclidean geometry and circulant decomposition resulting in a QC-LDPC matrix that avoids shorter girths for iterative decoding cycles. We emphasize that the proposed approach is different from the protographic construction method, masking method, identity matrix replacement method, algebraic based construction method, and base graph method used for the construction of QC-LDPC codes.

DOI: 10.1109/aero50100.2021.9438238

Related papers

Quasi-Cyclic Low-Density Parity-Check Codes Based on Progressive Cycle Growth Algorithm

Yuanhua Liu, Meiling Zhang, Niu Xin-Liang

Short cycles in the Tanner graph of a given LDPC code has negative effect on the performance of iterative decoding. To improve the performance, we presented an approach for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes whose associated Tanner graph has large girth and a small amount of short cycles. Each column block of the parity check matrix was designed by adding circulant permutation sub-matrices one after another, provided the current parity check matrix has minimal number of short cycles. The condition for the proposed QC-LDPC codes to have girth at least 6 was also analyzed. Regular and irregular QC-LDPC codes with various lengths and rates can be constructed. Simulations show that the proposed QC-LDPC codes have less short cycles and better performance than existing progressive edge growth based QC-LDPC codes.

International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)Jul 1, 20161 citation

Quasi-Cyclic LDPC Codes from Generalized Behrend Sequences for Space Applications

Suresh Kumar Venkataramanappa, P. Vijay Kumar, Deepak Mishra +1 more

We present a novel construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with arbitrary column weight and girth at least eight. By carefully designing the parity-check matrix, our approach ensures both structural flexibility and improved error-correction capabilities. We evaluate the performance of these codes under the additive white Gaussian noise (AWGN) channel. Simulation results demonstrate that the proposed QC-LDPC codes outperform the protograph LDPC codes included in the Consultative Committee for Space Data Systems (CCSDS) telecommand standards. Additionally, we benchmark our proposed codes against existing short-length codes with girth 8, observing improvements in the decoding performance while ensuring suitability for hardware implementation. The findings of this work contribute to the ongoing development of efficient LDPC codes suitable for ultra-reliable low-latency communications and area-efficient architecture designs for the Internet of Things (IoT), machine-to-machine (M2M), and satellite communications.

GlobecomDec 8, 20250 citations

Optimized Construction of Short and High Rate Protograph QC-LDPC Codes

Jianrong Bao, Xiaorong Xu, Chao Liu +2 more

To obtain efficient and pragmatic channel codes high signal-to-noise ratios (SNRs), an optimized construction of short and high rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is presented. Based on an optimized protograph template, the code framework is firstly produced by the extensions of the variable nodes. By enlarging the dimension of the sub-matrices related to the protograph framework, the base quasi-cyclic (QC) matrix is generated with required code rate and length. Then, the elements in the base matrix are split with even smaller square sub-matrices of the same row and column weights. In this procedure, a progressive edge growth (PEG) algorithm is employed to find the optimized positions of the QC submatrices, which brings larger girth for better code performance. Also the circulant offsets in all QC sub-matrices are optimally searched by a QC improved approximated cycle extrinsic message degree (QCI-ACE) algorithm, which improves the relationship of the unavoidable loops in the code's Tanner graph and thus it improves the error floor. Simulation results show that the codes produced by the proposed method demonstrate quite good bit error rate (BER) performance. In addition, they exhibit good properties of high spectrum efficiency by the high code rate, as well as the low complexity by the short code length. Therefore, the proposed code construction can be efficiently applied in the design of short and high rate protograph QC-LDPC codes with high rate and rational complexity.

International Conference on Wireless Communications and Signal Processing (WCSP)Oct 20, 20211 citation

Design and performance evaluation of low complexity encoding methods for LDPC codes

Ambar Bajpai, Lunchakorn Wuttisittikulkij, Piya Kovintavewat

There is an important breakthrough in the field of forward error correction techniques, low-density parity-check (LDPC) codes. These codes have potential to approach the Shannon limit with reliable performance on a given channel, known as the channel capacity. Recently, researchers pay much more attention towards LDPC codes because its performance is better than Turbo codes. However, the LDPC code is the best when it is an irregular code and uses with a very large block-length. Although, the short block-length LDPC codes perform not so well, they are easy to implement in various practical applications. Therefore, there is still a demand of new development on the encoding side of LDPC codes for various ranges of code rate and code length so as to capable of using in many applications.This thesis proposes the development of quasi-cyclic (QC) LDPC codes for column weight 3. In the first part of this thesis, we propose a new construction algorithm of QC-LDPC codes for medium to large block-length by combining QC-LDPC codes of small block-length as their component codes, via Chinese remainder theorem (CRT). Such component codes were constructed by permuting each column block sequentially to attain the desire local girth. After combining all component codes to generate an expanded parity-check matrix, the resulting girth is greater than or at least equal to the maximum girth of the component codes. Simulation results show that our proposed construction method of the parity-check matrix significantly outperforms the other well-known existing methods in terms of low error-floor, simple structure, high performance, and can reduce encoding complexity.In addition, this thesis also proposes two new construction methods for QC-LDPC codes, namely a base matrix method and a subtraction based method. A base matrix based method is a simple, less computational complexity method for constructing the exponent matrix (3, K) of girth 8, 10 and 12 of QC-LDPC codes. Another method is a subtraction method, which has a similar exponent matrix as a base matrix method and has a girth at least 8. Results indicate that the LDPC codes constructed from these two methods have flexibility for arbitrary block-column length K and have a similar BER performance if compared to existing methods.

Jan 1, 20150 citations

Design of good quasi-cyclic LDPC codes

Xu Dan

The existing design of quasi-cyclic(QC) low-density parity-check(LDPC) codes has not considered the problems of short length girths and the rows' dependency.The first problem leads to the BER performance of QC LDPC codes to be much poorer than that of randomly constructed LDPC codes,while the second problem leads to the difficulty of construction of generator matrices from parity-check matrices.To solve the first problem,the constraint conditions for designing the QC LDPC codes are proposed,and the dimension and shift factors of the circulant matrices of the given sparse parity-check matrix are adjusted according to the test results of both girth 4 and girth 6.To solve the second problem,an approach of irregular QC LDPC codes is proposed.The proposed approach is to replace some sub-matrices by zero matrices and identity matrices at special positions in the given sparse parity-check matrix so as to get a nonsingular square matrix for the construction of the generator matrix.Though adopting bidiagonal submatrices in parity-check matrix can solve the rows' dependency problem,many code words with low weights will occur,which leads to the BER performance can not be better by increasing code lengths.Examples are provided for the proposed design of QC LDPC codes,and computer simulation results show that the proposed QC LDPC codes achieve good BER performance.

Systems engineering and electronicsJan 1, 20091 citation

Structural Analysis of Generalized Quasi-Cyclic LDPC Codes: Rank, Design, and Generator Matrices

Roxana Smarandache, David G. M. Mitchell, Anthony Gómez-Fonseca

Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication. The block error rate performance of the GLDPC codes, combined with a complementary outer code, has been shown to outperform a variety of state-of-the-art code and decoder designs with suitable lengths and rates for the 5G ultra-reliable low-latency communication (URLLC) regime. A major drawback of these codes is that it is not known how to construct appropriate polynomial matrices to encode them efficiently. In this paper, we analyze practical constructions of quasi-cyclic GLDPC (QC-GLDPC) codes and show how to construct polynomial generator matrices in various forms using minors of the polynomial matrix. The approach can be applied to fully generalized matrices or partially generalized (with mixed constraint node types) to find better performance/rate trade-offs. The resulting encoding matrices are presented in useful forms that facilitate efficient implementation. The rich substructure displayed also provides us with new methods of determining low weight codewords, providing lower and upper bounds on the minimum distance and often giving those of weight equal to the minimum distance. Based on the minors of the polynomial parity-check matrix, we also give a formula for the rank of any parity-check matrix representing a QC-LDPC or QC-GLDPC code, and hence, the dimension of the code. Finally, we show that by applying double graph-liftings, the code parameters can be improved without affecting the ability to obtain a polynomial generator matrix.

IEEE Transactions on Information TheoryOct 27, 20253 citations