Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Optimized Generalized LDPC Convolutional Codes

View through CrossRef
In this paper, some optimized encoding and decoding schemes are proposed for the generalized LDPC convolutional codes (GLDPC–CCs). In terms of the encoding scheme, a flexible doping method is proposed, which replaces multiple single parity check (SPC) nodes with one generalized check (GC) node. Different types of BCH codes can be selected as the GC node by adjusting the number of SPC nodes to be replaced. Moreover, by fine-tuning the truncated bits and the extended parity check bits, or by reasonably adjusting the GC node distribution, the performance of GLDPC–CCs can be further improved. In terms of the decoding scheme, a hybrid layered normalized min-sum (HLNMS) decoding algorithm is proposed, where the layered normalized min-sum (LNMS) decoding is used for SPC nodes, and the Chase–Pyndiah decoding is adopted for GC nodes. Based on analysis of the decoding convergence of GC node and SPC node, an adaptive weight factor is designed for GC nodes that changes as the decoding iterations, aiming to further improve the decoding performance. In addition, an early stop decoding strategy is also proposed based on the minimum amplitude threshold of mutual information in order to reduce the decoding complexity. The simulation results have verified the superiority of the proposed scheme for GLDPC–CCs over the prior art, which has great application potential in optical communication systems.
Title: Optimized Generalized LDPC Convolutional Codes
Description:
In this paper, some optimized encoding and decoding schemes are proposed for the generalized LDPC convolutional codes (GLDPC–CCs).
In terms of the encoding scheme, a flexible doping method is proposed, which replaces multiple single parity check (SPC) nodes with one generalized check (GC) node.
Different types of BCH codes can be selected as the GC node by adjusting the number of SPC nodes to be replaced.
Moreover, by fine-tuning the truncated bits and the extended parity check bits, or by reasonably adjusting the GC node distribution, the performance of GLDPC–CCs can be further improved.
In terms of the decoding scheme, a hybrid layered normalized min-sum (HLNMS) decoding algorithm is proposed, where the layered normalized min-sum (LNMS) decoding is used for SPC nodes, and the Chase–Pyndiah decoding is adopted for GC nodes.
Based on analysis of the decoding convergence of GC node and SPC node, an adaptive weight factor is designed for GC nodes that changes as the decoding iterations, aiming to further improve the decoding performance.
In addition, an early stop decoding strategy is also proposed based on the minimum amplitude threshold of mutual information in order to reduce the decoding complexity.
The simulation results have verified the superiority of the proposed scheme for GLDPC–CCs over the prior art, which has great application potential in optical communication systems.

Related Results

Generalised array low‐density parity‐check codes
Generalised array low‐density parity‐check codes
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of pr...
The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes
The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes
The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon lim...
A Convergence Analysis of LDPC Decoding Based on Eigenvalues
A Convergence Analysis of LDPC Decoding Based on Eigenvalues
Low-density parity check (LDPC) codes are very popular among error correction codes because of their high-performance capacity. Numerous investigations have been carried out to ana...
Effect of Random Jitter on Performance of LDPC
Effect of Random Jitter on Performance of LDPC
Low density parity check codes (LDPC) by now is an excellent channel code that approaches Shannons limit. In order to get the effect of random jitter on performance of LDPC, a simu...
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Novel/Old Generalized Multiplicative Zagreb Indices of Some Special Graphs
Topological descriptor is a fixed real number directly attached with the molecular graph to predict the physical and chemical properties of the chemical compound. Gutman and Trinaj...
Properties of Fuzzy Soft Codes and Their Role in Decision-Making
Properties of Fuzzy Soft Codes and Their Role in Decision-Making
Background Fuzzy soft sets are well-established for decision-making under uncertainty. However, integrating soft set theory with fuzzy codes remains unexplored, as fuzzy soft code ...
Quasi~λ-cyclic Codes Over a Class of Finite Commutative Semi-simple Rings
Quasi~λ-cyclic Codes Over a Class of Finite Commutative Semi-simple Rings
Abstract In coding theory, quasi λ-cyclic codes form an important class of codes which have been extensively studied. In this paper, we investigate the algebraic structure ...
188-OR: Assessing the Validity of Diagnosis Codes for Gestational Diabetes Ascertainment
188-OR: Assessing the Validity of Diagnosis Codes for Gestational Diabetes Ascertainment
Background: Researchers often rely on diagnosis codes from billing/administrative data to ascertain diagnoses, including gestational diabetes (GDM). We assessed the validity of rel...

Back to Top