Optimized Generalized LDPC Convolutional Codes

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.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2025-09-04
DOI
https://doi.org/10.3390/e27090930
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimized Generalized LDPC Convolutional Codes

Yongben Wang, Kai Tao, Yinlong Shi, Li Deng et al.
Entropy
Error Correcting Code Techniques
article

Optimized Generalized LDPC Convolutional Codes

Yongben Wang, Kai Tao, Yinlong Shi, Li Deng, Zhiping Shi, Tian Liu, Jian Wang, You Zhang
article en

Abstract

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.

EntropyVol. 27(9)
University of Electronic Science and Technology of China (CN), Huzhou Normal University (CN), ZTE (China) (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 73%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.