Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes With Large Girth

Tadayon, Mohammad Hesam; Tasdighi, Alireza; Battaglioni, Massimo; Baldi, Marco; Chiaraluce, Franco

doi:10.1109/lcomm.2018.2827959

Cited by 29 publications

(36 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we recall the basic assumptions of the design method proposed in [7]. The design of the paritycheck matrix of a QC-LDPC block code with lifting degree N starts from an exponent matrix having the following form (SMC assumption)…”

Section: Code Design Via Scmmentioning

confidence: 99%

“…The corresponding minimum values obtained through previous approaches are instead denoted as N * and m * h , respectively. According to (7), we can compute the ratio of the decoding latency of the newly designed QC-LDPC block codes over that of previous QC-LDPC block codes as…”

Section: A Latency and Complexity Performancementioning

confidence: 99%

“…Motivated by these arguments, in this paper we provide design examples and assess the performance of either QC-LDPC block codes with smaller blocklength or SC-LDPC-CCs with smaller constraint length than those with comparable girth available in the literature. These codes are designed according to the approach we have recently introduced in [7], and are denoted as compact codes to encompass block and convolutional LDPC codes with these features in one word.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications

Battaglioni

Tasdighi

Baldi

et al. 2018

2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Self Cite

View full text Add to dashboard Cite

Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low-density parity-check block codes and spatially coupled low-density parity-check convolutional codes that we denote as compact. They are defined by parity-check matrices designed according to a recent approach based on sequentially multiplied columns. This method allows obtaining codes with girth up to 12.Many numerical examples of practical codes are provided.

show abstract

Section: Code Design Via Scmmentioning

confidence: 99%

Section: A Latency and Complexity Performancementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications

Battaglioni

Tasdighi

Baldi

et al. 2018

2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Consequently, almost all of explicit structures proposed for algebraic-based QC-LDPC codes produce a Tanner graph with girth at least 6. However, obtaining Tanner graphs with larger girth has become a subject of research interest [2,5,6,11,14,18,19,20,21,23,25,27,28]. In order to decrease the number of short cycles, and probably raise the girth from 6 to at least 8, a technique known as masking has been employed by which some nonzero elements of an exponent matrix are turned into zero.…”

Section: Introductionmentioning

confidence: 99%

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field

Amirzade¹,

Sadeghi²,

Panario³

2020

AMC

View full text Add to dashboard Cite

Trapping sets significantly influence the performance of low-density parity-check codes. An (a, b) elementary trapping set (ETS) causes high decoding failure rate and exert a strong influence on the error floor of the code, where a and b denote the size and the number of unsatisfied check-nodes in the ETS, respectively. The smallest size of an ETS in (3, n)-regular LDPC codes with girth 6 is 4. In this paper, we provide sufficient conditions to construct fully connected (3, n)-regular algebraic-based QC-LDPC codes with girth 6 whose Tanner graphs are free of (a, b) ETSs with a ≤ 5 and b ≤ 2. We apply these sufficient conditions to the exponent matrix of a new algebraic-based QC-LDPC code with girth at least 6. As a result, we obtain the maximum size of a submatrix of the exponent matrix which satisfies the sufficient conditions and yields a Tanner graph free of those ETSs with small size. Some algebraic-based QC-LDPC code constructions with girth 6 in the literature are special cases of our construction. Our experimental results show that removing ETSs with small size contribute to have better performance curves in the error floor region.

show abstract

“…Besides, the SC-PLDPC codes suffer from relatively weaker decoding thresholds when the coupling length is small or moderate [20]. To deal with the above issue, some research effort has been devoted to the design and analysis of small-coupling-length SC-PLDPC codes [21]- [23] and small-constraint-length SC-PLDPC codes [24], [25] in order to achieve satisfactory decoding performance. In addition, the investigation regarding the performance improvement of finite-coupling-length SC-PLDPC codes in BICM scenarios has been conducted [26].…”

Section: Introductionmentioning

confidence: 99%

Interleaver Design for Small-Coupling-Length Spatially Coupled Protograph LDPC-Coded BICM Systems Over Wireless Fading Channels

2020

View full text Add to dashboard Cite

As a class of convolutional error-correction codes (ECCs), spatially coupled protograph low-density parity-check (SC-PLDPC) codes with a sufficiently large coupling length can approach the channel capacity under belief propagation (BP) decoding. However, such codes suffer from poor performance in the case of small coupling lengths. To address the above weakness, we investigate the optimization and analysis of SC-PLDPC-coded bit-interleaved coded modulation (BICM) systems over Rayleigh fading channels. Specially, inspired by the unequal-error-protection (UEP) mechanism of M-ary phase-shift keying/ quadrature amplitude modulation (M-PSK/QAM), we put forward a novel interleaver design scheme, referred to as spatial position match mapping (SPMM) scheme. Based on the mutual information (MI) analysis, the proposed interleaver can be used to significantly boost the performance of the SC-PLDPC codes in BICM systems. Furthermore, we propose a block-scheduling protograph-based extrinsic information transfer (BS-PEXIT) algorithm to estimate the convergence performance (i.e, decoding threshold) of the SPMM-aided SC-PLDPC codes in BICM scenarios. Simulation results are well consistent with the theoretical analyses, and show that the proposed SPMM-aided SC-PLDPC-coded BICM systems are superior to the state-of-the-art counterparts. INDEX TERMS Spatially coupled protograph low-density parity-check (SC-PLDPC) codes, bit-interleaved coded modulation (BICM), interleaver, wireless fading channels.

show abstract

Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes With Large Girth

Cited by 29 publications

References 13 publications

Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications

Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications

QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field

Interleaver Design for Small-Coupling-Length Spatially Coupled Protograph LDPC-Coded BICM Systems Over Wireless Fading Channels

Contact Info

Product

Resources

About