An Iterative Decoding Scheme for CPM-QC-LDPC Codes Based on Matrix Transform

Xu, Zuohong; Zhu, Jiang; Cheng, Qi; Zhang, Zixuan

doi:10.1587/transcom.2018ebp3177

Cited by 3 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A practical system model with global interleaving is proposed for the optimization of degree distribution of the LDPC codes, which systematically solves the optimal system design of cascade irregular LDPC-CPM [25]. Zuohong Xu propose a two-stage decoding scheme mainly based on parity check matrix transform, which can efficiently improve the bit error rate performance [26]. All of the above schemes optimize the LDPC-CPM system to some extent, but they all adopt binary coding, the design and optimization of NB-LDPC-CPM system are still lacking.…”

Section: Introductionmentioning

confidence: 99%

Optimized Design for NB-LDPC-Coded High-Order CPM: Power and Iterative Efficiencies

Xue

Wang

Sun³

et al. 2020

Symmetry

View full text Add to dashboard Cite

In this paper, a non-binary low-density parity-check (NB-LDPC) coded high-order continuous phase modulation (CPM) system is designed and optimized to improve power and iterative efficiencies. Firstly, the minimum squared normalized Euclidean distance and the 99% double-sided power bandwidth are introduced to design a competitive CPM, improving its power efficiency under a given code rate and spectral efficiency. Secondly, a three-step method based on extrinsic information transfer (EXIT) and entropy theory is used to design NB-LDPC codes, which reduces the convergence threshold approximately 0.42 and 0.58 dB compared with the candidate schemes. Thirdly, an extrinsic information operation is proposed to address the positive feedback issue in iterative detection and decoding and the value of bit error rate (BER) can approximately be reduced by 5×10−3. Finally, iteration optimization employing the EXIT chart and mutual information between demodulation and decoding is performed to achieve a suitable tradeoff for the communication reliability and iterative decoding delay. Simulation results show that the resulting scheme provides an approximately 3.95 dB coding gain compared to the uncoded CPM and achieves approximately 0.5 and 0.7 dB advantages compared with the candidate schemes. The resulting NB-LDPC-coded high-order CPM for a given code rate and spectral efficiency converges earlier into a turbo cliff region compared with other competitors and significantly improves power and iterative efficiencies.

show abstract

Section: Introductionmentioning

confidence: 99%

Optimized Design for NB-LDPC-Coded High-Order CPM: Power and Iterative Efficiencies

Xue

Wang

Sun³

et al. 2020

Symmetry

View full text Add to dashboard Cite

show abstract

“…Introduction: Quasi-cyclic (QC) structure can facilitate the hardware implementation of encoding and decoding for low-density parity-check (LDPC) codes [1][2][3][4][5][6][7]. QC-LDPC codes have good waterfall/error-floor performance and converge fast when decoded with the iterative algorithms [8].…”

mentioning

confidence: 99%

A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes

Xu,

Zhang,

et al. 2024

Electronics Letters

View full text Add to dashboard Cite

M. Fossorier proposed how to determine the necessary and sufficient conditions for the existence of cycles in the Tanner graph of quasi‐cyclic LDPC (QC‐LDPC) codes, which has been widely investigated in the study of LDPC codes. This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved conditions. Numerical results show that, compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a cyclic‐shift way.

show abstract

A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes

Zhou

Zhu

et al. 2021

IEEE Access

View full text Add to dashboard Cite

In this paper, we study the cycle structure of (3, 19)-regular Tanner's quasi-cyclic (QC) LDPC codes with code length 19p, where p is a prime and p ≡ 1 (mod 57), and transform the conditions for the existence of cycles of lengths not more than 10 into polynomial equations in a 57th root of unity of the prime field F p. By employing the Euclidean division algorithm to check whether these equations have solutions over the prime field F p , the girth values of (3, 19)-regular Tanner's QC-LDPC codes of code length 19p are determined. In order to show the good performance of this class of QC-LDPC codes, numerical results are also provided. INDEX TERMS QC-LDPC codes, Tanner graph, girth, prime field I. INTRODUCTION Quasi-cyclic (QC) LDPC codes [1] are a class of wellknown channel codes, and widely used in the communication and storage systems because of their excellent features: lowcomplexity encoding and decoding algorithms [2]-[5], good performance in the waterfall and error-floor regions [6]-[10], and easy implementations in hardware [11]-[13]. In general, the low-complexity algorithms for decoding LDPC codes are under the frame of iterative decoding. However, short cycles in the Tanner graph [14] of an LDPC code degrade the iterative decoding performance. Hence, constructing large girth LDPC codes and/or determining their girths is of interest in coding theory and graph theory [15], [16].

show abstract

An Iterative Decoding Scheme for CPM-QC-LDPC Codes Based on Matrix Transform

Cited by 3 publications

References 23 publications

Optimized Design for NB-LDPC-Coded High-Order CPM: Power and Iterative Efficiencies

Optimized Design for NB-LDPC-Coded High-Order CPM: Power and Iterative Efficiencies

A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes

A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes

Contact Info

Product

Resources

About