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...
Novel algorithm to construct QC-LDPC codes for high data rate applications
Novel algorithm to construct QC-LDPC codes for high data rate applications
A novel algorithm to construct highly sparse, quasi-cyclic low-density parity check codes with large girth and high code rates that can be employed in high data rate applications i...
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
Abstract A number of studies focus on Low-Density Parity-Check (LDPC) codes to ensure reliable data communications. This study proposes an algebraic algorithm to generate s...
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
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...
Huffrith Algorithm with Quasi Cyclic Low Density Parity Check in NOMA Systems
Huffrith Algorithm with Quasi Cyclic Low Density Parity Check in NOMA Systems
In this paper, the high-rate Quasi-Cyclic Low-Density Parity -Check (QC-LDPC) as an error correction code is contributed for Non-orthogonal Multiple Access (NOMA) systems with high...
Optimized Polar Codes as Forward Error Correction Coding for Digital Video Broadcasting Systems
Optimized Polar Codes as Forward Error Correction Coding for Digital Video Broadcasting Systems
Polar codes are featured by their low encoding/decoding complexity for symmetric binary input-discrete memoryless channels. Recently, flexible generic Successive Cancellation List ...

Back to Top