IEEE Transactions on Vehicular Technology

Globally Coupled Finite Geometry and Finite Field LDPC Coding Schemes

Mona Nasseri, Xin Wei Xiao, Bane V. Vasic, Shu Lin

Published Aug 4, 2021• 14 citations

Abstract

This paper presents two types of concatenated LDPC coding schemes which are viewed asgeneralized globally coupled(GC)LDPCcoding schemes in which outer codes serve as thelocal codesfor correcting local errors and inner codes serve asglobal coupling codesto correct global errors. The first type of concatenated LDPC coding scheme globally couples a finite geometry (FG) LDPC code as the local code and a finite field (FF) LDPC code as the global coupling code. This type of global coupling, calledGC-FG/FF-LDPC coupling, combines the distinct features of both FG- and FF-LDPC codes to achieve low error rates at a rapid decoding convergence and an error performance close to the Shannon limit. Decoding of a GC-FG/FF-LDPC code is carried out intwo iterative phases, global/local or local/global. In the second type of concatenated LDPC coding scheme, both local and global coupling codes are FF-LDPC codes. If both local and global coupling codes are constructed from the same finite field and have the same graphical structures, a GC-FF/FF-LDPC code can be decoded in one phase or two phases iteratively, otherwise, it can be decoded in two phases. Construction of GC-FF/FF-LDPC codes is very flexible in lengths and rates. The proposed two-phase iterative decoding is practically implementable.

DOI: 10.1109/tvt.2021.3102178

Related papers

Concatenated finite geometry and finite field LDPC codes

Mona Nasseri, Xin Wei Xiao, Shaoliang Zhang +2 more

This paper presents two types of concatenated finite-geometry and finite-field LDPC codes which have the distinct features of both finite geometry and finite field LDPC codes, such as large minimum distances, no small trapping sets, fast decoding convergence, capable of correcting both random errors and bursts of erasures, flexibility in code construction, cyclic and quasi-cyclic structures. It is shown that these concatenated codes are globally coupled LDPC codes and they perform well over the AWGN and binary erasure channels with a two-phase iterative decoding scheme.

International Conference on Signal Processing and Communication SystemsDec 1, 20172 citations

Tail-Biting Globally-Coupled LDPC Codes

Ji Zhang, Baoming Bai, Shuangyang Li +2 more

This paper presents a new type of globally-coupled low-density parity-check (GC-LDPC) codes whose base matrix has a cyclic structure in the global part. Therefore, the resulting codes are referred to as tail-biting GC-LDPC (TB-GC-LDPC) codes. We propose two methods to construct TB GC quasi-cyclic LDPC (TB-GC-QC-LDPC) codes. For the first method, we extract a replicated version of a constructed base matrix and mask it with a designed masking matrix. Compared to the conventional construction methods, this method provides more flexibility in code length for TB-GC-QC-LDPC codes. The second method is based on designing the incidence matrix of a special type of packings. Examples show that the constructed TB-GC-QC-LDPC codes perform well over the additive white Gaussian noise channel (AWGNC) and the binary erasure channel (BEC). The asymptotic performance of TB-GC-LDPC ensembles over BECs are also analyzed by resorting to density evolution. Moreover, numerical results show that TB-GC-LDPC ensembles can achieve better flooding-schedule decoding (FSD) thresholds than the corresponding GC-LDPC ensembles with a similar structure. With sufficient decoding iterations in the global phase, the local/global two-phase iterative decoding (TPD) thresholds of the TB-GC-LDPC ensembles significantly outperform those of the corresponding GC-LDPC ensembles as well.

IEEE Transactions on CommunicationsOct 1, 201918 citations

Globally coupled LDPC codes

Juane Li, Shu Lin, Khaled Abdel-Ghaffar +2 more

This paper presents a special type of LDPC codes with a structure related to but different from that of the spatially coupled LDPC codes. For an LDPC code of this type, its Tanner graph is composed of a set of small disjoint Tanner graphs which are connected together by a group of overall check-nodes, called global check-nodes. Codes of this type are called globally coupled LDPC codes and they perform well over both the additive Gaussian white noise and the binary-erasure channels. Furthermore, they are very effective at correcting erasures clustered in bursts. Two algebraic methods are presented for constructing these codes. A two-phase local/global iterative scheme for decoding these codes is presented. This decoding scheme allows correction of local random and global errors and/or erasures in two phases.

Information Theory and Applications Workshop (ITA)Jan 1, 201634 citations

Reed-Solomon based globally coupled quasi-cyclic LDPC codes

Juane Li, Keke Liu, Shu Lin +1 more

This paper presents a special type of LDPC codes constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes. LDPC codes of this type are referred to as globally coupled RS-LDPC codes. These codes are designed for correcting random errors, random short phased bursts of erasures and long bursts of erasures. The Tanner graph of a globally coupled RS-LDPC is composed of a number of disjoint copies of the Tanner graph of a local RS-LDPC code which are connected together by a group of overall check-nodes (CNs), called global CNs. A globally coupled RS-LDPC code can be decoded with a two-phase local/global iterative scheme which allows correction of local random errors and phased bursts of erasures in the local phase and global random errors and a single long burst of erasures in the global phase.

Information Theory and Applications Workshop (ITA)Feb 1, 201720 citations

Finite-Geometry LDPC Codes

W.E. Ryan, Shu Lin

Finite geometries, such as Euclidean and projective geometries, are powerful mathematical tools for constructing error-control codes. In the 1960s and 1970s, finite geometries were successfully used to construct many classes of easily implementable majority-logic decodable codes. In 2000, Kou, Lin, and Fossorier [1–3] showed that finite geometries can also be used to construct LDPC codes that perform well and close to the Shannon theoretical limit with iterative decoding based on belief propagation. These codes are called finite-geometry (FG) -LDPC codes. FG-LDPC codes form the first class of LDPC codes that are constructed algebraically. Since 2000, there have been many major developments in construction of LDPC codes based on various structural properties of finite geometries [4–18]. In this chapter, we put together all the major constructions of LDPC codes based on finite geometries under a unified frame. We begin with code constructions based on Euclidean geometries and then go on to discuss those based on projective geometries. Construction of LDPC Codes Based on Lines of Euclidean Geometries This section presents a class of cyclic LDPC codes and a class of quasi-cyclic (QC) LDPC codes constructed using lines of Euclidean geometries. Before we present the constructions of these two classes of Euclidean-geometry (EG)-LDPC codes, we recall some fundamental structural properties of a Euclidean geometry that have been discussed in Chapter 2.

Cambridge University Press eBooksSep 17, 20091 citation

Two-Phase Globally Coupled Low-Density Parity Check Decoding Aided with Early Termination and Forced Convergence

Kun Zhu, Hongwen Yang

To enhance the decoding efficiency of Globally Coupled (GC) LDPC codes, we incorporated Early Termination (ET) and Forced Convergence (FC) into the local/global two-phase decoding algorithm to expedite the decoding process. The two-phase decoding scheme integrates the ET technique to halt unnecessary iterations in the local decoding phase while employing the FC technique to accelerate convergence in the global phase decoding. The application of ET technology in the local decoding of GC-LDPC codes will not cause performance loss as in traditional block codes and will cause considerable complexity gains. For a longer code length and larger convergence differences between nodes' global codes, the FC technique operates more efficiently in global code than local code. Two variants are proposed for the ET scheme in the local decoding, namely ET-1 and ET-2. The initial variant, ET-1, predicts whether local decoding can be successful according to data characteristics and stop the local decoding iteration that is not expected to be successful in time. In the case of ET-2, the saved local iterations are transformed to global decoding equally. The results show that ET-1 saves considerable decoding time complexity and ET-2 improves the performance of the GC-LDPC code with the same decoding time complexity. The combined approach of ET-1 with FC reduces the decoding time complexity up to 42% at a low Signal Noise Rate region while maintaining its performance; ET-2-FC two-phase decoding saves approximately 25% decoding time complexity while improving the BER by about 0.18 dB and FER by about 0.23 dB.

SensorsOct 27, 20242 citations