Corpus ID: 236447749

On the Construction of Protograph-based Partially Doped GLDPC Codes

  title={On the Construction of Protograph-based Partially Doped GLDPC Codes},
  author={Jaewha Kim and Jaewha Kim and Jong-Seon No},
A generalized low-density parity-check (GLDPC) code is a class of codes, where single parity check nodes in a conventional low-density parity-check (LDPC) code are replaced by linear codes with higher parity check constraints. In this paper, we introduce a new method of constructing GLDPC codes by inserting the generalized check nodes for partial doping. While the conventional protograph GLDPC code dopes the protograph check nodes by replacing them with the generalized check nodes, a new GLDPC… Expand

Figures and Tables from this paper


Hybrid hamming GLDPC codes over the binary erasure channel
  • Rong Guan, Lijun Zhang
  • Computer Science
  • 2017 11th IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)
  • 2017
Simulation results show that, in comparison with standard LDPC codes and the state-of-the-artGLDPC codes with hybrid variable nodes (VNs), the GLDPC code proposed in this paper has better asymptotic performance. Expand
On the typical minimum distance of protograph-based generalized LDPC codes
This paper upper bound the ensemble weight enumerators for finite-length GLDPC codes based on protographs, and then considers the sum of weight enumerator, to determine whether or not the typical minimum distance in the ensemble grows linearly with codeword length. Expand
Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling
This paper presents a comprehensive analysis of spatially coupled generalized low-density parity-check codes and presents an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect. Expand
A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC
The probabilistic peeling decoding (P-PD) algorithm is proposed, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a successful decoding probability that depends on both the GC block code and its decoding algorithm. Expand
Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds
Density evolution for protograph low-density parity-check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2Expand
Analyzing the finite-length performance of generalized LDPC codes
A generalized peeling decoder is proposed and a system of differential equations is derived that gives the expected evolution of the graph degree distribution during decoding, which shows that the finite-length performance of a GLDPC code can be estimated by means of a simple scaling law. Expand
Design of LDPC code ensembles with fast convergence properties
The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated, showing that these structures can offer better performance than LDPC codes for low-iteration-number designs. Expand
Hamming-GLDPC Codes in BEC and AWGN Channel
Hamming codes are used as component codes to construct generalized low-density parity-check (GLDPC) codes. In BEC channel, the convergence behavior of the Hamming-GLDPC codes is theoreticallyExpand
On the minimum distance of generalized spatially coupled LDPC codes
It is shown that, in addition to their excellent iterative decoding thresholds, ensembles of GSC-LDPC codes are asymptotically good and have large minimum distance growth rates. Expand
Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes
This paper derived ensemble codeword weight enumerators for finite-length LDPC and G-LDPC codes based on protographs, and then the asymptotic case was considered to determine whether or not the typical relative minimum distance in the ensemble grows linearly withcodeword length. Expand