Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Optics Express

Graph model-aided optimal iterative decoding technique for LDPC in optical fiber communication

Qinghua Tian, Yiqun Pan, Xiangjun Xin, Lei Zhu, Zhipei Li, Chenchen Wang, Ze Dong, Ran Gao, Feng Tian, Fu Wang, Leijing Yang, Qi Zhang, Yongjun Wang

Published Dec 19, 2024• 8 citations
Publisher

Abstract

The neural networks offer iteration capability for low-density parity-check (LDPC) decoding with superior performance at transmission. However, to cope with increasing code length and rate, the complexity of the neural network increases significantly. This is due to the large amount of feature extraction required to maintain the error correction capability. Based on this gap, we design a new iterative LDPC decoding technique named graph model neural network-belief propagation (GMNN-BP). GMNN-BP uses graph models as a link between deep learning and belief propagation (BP) algorithms, combining the advantages of both. Compared to traditional fully connected neural network decoders, the GMNN-BP decoding has the substantial benefit of avoiding learning and judging codeword categories directly from a large amount of data and requiring less training data as well. The proposed algorithm is verified by simulation and experiment and is tested by using IEEE 802.3ca standard LDPC code word. The results show that the GMNN-BP decoding algorithm is superior to the BP-based iterative decoding method under the same number of iterations, and the maximum gain can reach 1.9dB. When achieving the same performance, the GMNN-BP decoding algorithm only requires half the number of iterations of other algorithms.

DOI
10.1364/oe.534637

Related papers

Normalized Neural Network for Belief Propagation LDPC Decoding

Yiduo Tang, Lin Zhou, Shuying Zhang +2 more

BP decoding algorithm is one of the commonly used decoding algorithms for LDPC codes. To adapt LDPC codes to different 5G scenarios and further improve the decoding performance of short LDPC codes, a scheme combining model-driven deep learning with a traditional BP decoding algorithm is proposed. With the advantages of model-driven, this solution expands the decoding iteration process between the check node and the variable node into a neural network and proposes a parameter normalization optimization solution to solve the problem of the program with many training parameters, the edge weights of the optimized Tanner graph are re-assigned and bound. Simulation results show that the proposed scheme can improve the decoding performance of LDPC codes with short lengths.

IEEE International Conference on Networking, Sensing and Control (ICNSC)•Dec 3, 2021•8 citations

Graph Neural Networks for Channel Decoding

Sebastian Cammerer, Jakob Hoydis, Fayçal Ait Aoudia +1 more

In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.

arXiv:2207.14742•IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2022•61 citations

Performance Analysis of Sub-Optimal LDPC Decoder for 5G using Belief Propagation Algorithm

Avinash Subramaniam M, Jay Sejpal, Pasupuleti Rithvij +2 more

Today's modern wireless communication systems demand extensive quality and computational power with an increase in day-to-day data-rate standards. The latest com-munication standards focus on low latency, high throughput, and reliable error correction capabilities which inspired us to explore the 5G New Generation (NR) technology. Low-Density Parity-Check Codes (LDPC) are known to have error correction capabilities that can achieve Shannon's maximum channel ca-pacity. Encoding of LDPC Codes features a sparse property that enables effortless decoding at the receiver end. Advancements in deep learning have helped in estimating the channel noise more accurately. The Iterative Belief Propagation-Convolutional Neural Network (BP-CNN) architecture involves a CNN block which is trained with a quadratic loss function concatenated to a standard BP Decoder. The proposed Iterative BP-CNN architecture with a Batch Normalization layer results in a better performance compared to the Iterative BP-CNN architecture as it standardizes the input to the CNN block and also solves the problem of vanishing gradients during backpropagation.

International Conference on Internet of Everything, Microwave Engineering, Communication and Networks (IEMECON)•Dec 1, 2021•5 citations

Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes

Anqi Gong, Sebastian Cammerer, Joseph M. Renes

In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers. Both components of the decoder are defined over the same sparse decoding graph enabling a seamless integration and scalability to large codes. The core idea is to use the GNN component between consecutive BP runs so that the knowledge from the previous BP run can be leveraged to better initialize the next BP run. This enables the proposed decoder to learn to compensate for sub-optimal BP decoding graphs that result from the design constraints of quantum LDPC codes. Since the entire decoder remains differentiable, gradient descent-based training is possible. We compare the error rate performance of the proposed decoder against various post-processing methods such as random perturbation, enhanced feedback, augmentation, and ordered-statistics decoding (OSD) and show that a carefully designed training process lowers the error-floor significantly. As a result, our proposed decoder outperforms the former three methods using significantly fewer post-processing attempts. The source code of our experiments is available online.

arXiv:2310.17758•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•21 citations

Low Complexity Neural Network-Aided NMS LDPC Decoder

Honghao Shi, Mingyang Zhong, Zhiyong Luo +1 more

For recent years, deep learning has been studied and utilized among decoders in wireless and optical communication. For low density parity check (LDPC) codes, most works use neural network (NN) to implement the belief propagation (BP) decoder and unfold its iterations into layers activated by different functions. However, the whole decoder composed by neural network performs lots of non-linear operations, which are time consuming and unfriendly to hardware implementation. In this work, a neural network-aided normalized min-sum (NN-aided NMS) decoder for LDPC code is proposed, in which the normalization factors are inferred from input log likelihood ratio (LLR) by apre-trained NN, while maintaining check and variable nodes processing the same as in min-sum (MS) decoder. In order to test the proposed decoder with irregular LDPC code, a rate-7/8 one was constructed using progressive edge growth (PEG) algorithm, showing better error correction capability than the standard of consultative committee for space data systems (CCSDS) LDPC (8176,7154) code by 0.08 dB with the same rate. Simulation results show that, NN-aided NMS decoder outperforms MS decoder by 0.3 dB, and its performance approaches BP decoder with a gap of 0.02 dB, which is 50% closer than the best NMS decoder using 0.7 as the normalization factor. The proposed decoder has good performance for both regular and irregular LDPC codes, and needs much less computation complexity than BP decoder. It introduces more linear computation than NMS decoder but achieves better bit error rate (BER) performance, thus becoming a good complement between BP and NMS decoder when trading off among complexity, error correction performance and hardware implementation for wireless and satellite communication.

Computing, Communications and IoT Applications (ComComAp)•Nov 26, 2021•8 citations

A Model-Driven Quasi-ResNet Belief Propagation Neural Network Decoder for LDPC Codes

Liangsi Ma, Bei Liu, Xin Su +1 more

For the Belief Propagation (BP) algorithm of low-density parity-check (LDPC) codes, existing deep learning methods have a limited performance improvement and it is difficult to train deep-level networks. In this paper, a model-driven quasi-residual network (Quasi-ResNet) BP decoding architecture is proposed for LDPC codes to further improve the performance of standard BP decoding. This method feeds the reliable messages calculated in current iteration into the next iteration based on the shortcut connection, and adjusts the weight of shortcut connection based on the error Back Propagation algorithm of neural network to determine the optimal genetic proportion of reliable messages. The decoding architecture is composed of a model-driven deep neural network (DNN) and shortcut connection. Simulation results show that the decoder can not only unfold more layers quickly compared with the DNN-based BP decoder, but also further improve the decoding performance.

IEEE Symposium on Computers and Communications (ISCC)•Jul 9, 2023•1 citation
The neural networks offer iteration capability for low-density parity-check (LDPC) decoding with superior performance at transmission. However, to cope with increasing code length and rate, the complexity of the neural network increases significantly. This is due to the large amount of feature extraction required to maintain the error correction capability. Based on this gap, we design a new iterative LDPC decoding technique named graph model neural network-belief propagation (GMNN-BP). GMNN-BP uses graph models as a link between deep learning and belief propagation (BP) algorithms, combining the advantages of both. Compared to traditional fully connected neural network decoders, the GMNN-BP decoding has the substantial benefit of avoiding learning and judging codeword categories directly from a large amount of data and requiring less training data as well. The proposed algorithm is verified by simulation and experiment and is tested by using IEEE 802.3ca standard LDPC code word. The results show that the GMNN-BP decoding algorithm is superior to the BP-based iterative decoding method under the same number of iterations, and the maximum gain can reach 1.9dB. When achieving the same performance, the GMNN-BP decoding algorithm only requires half the number of iterations of other algorithms.
BP decoding algorithm is one of the commonly used decoding algorithms for LDPC codes. To adapt LDPC codes to different 5G scenarios and further improve the decoding performance of short LDPC codes, a scheme combining model-driven deep learning with a traditional BP decoding algorithm is proposed. With the advantages of model-driven, this solution expands the decoding iteration process between the check node and the variable node into a neural network and proposes a parameter normalization optimization solution to solve the problem of the program with many training parameters, the edge weights of the optimized Tanner graph are re-assigned and bound. Simulation results show that the proposed scheme can improve the decoding performance of LDPC codes with short lengths.
In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.
Today's modern wireless communication systems demand extensive quality and computational power with an increase in day-to-day data-rate standards. The latest com-munication standards focus on low latency, high throughput, and reliable error correction capabilities which inspired us to explore the 5G New Generation (NR) technology. Low-Density Parity-Check Codes (LDPC) are known to have error correction capabilities that can achieve Shannon's maximum channel ca-pacity. Encoding of LDPC Codes features a sparse property that enables effortless decoding at the receiver end. Advancements in deep learning have helped in estimating the channel noise more accurately. The Iterative Belief Propagation-Convolutional Neural Network (BP-CNN) architecture involves a CNN block which is trained with a quadratic loss function concatenated to a standard BP Decoder. The proposed Iterative BP-CNN architecture with a Batch Normalization layer results in a better performance compared to the Iterative BP-CNN architecture as it standardizes the input to the CNN block and also solves the problem of vanishing gradients during backpropagation.
In this work, we propose a fully differentiable iterative decoder for quantum low-density parity-check (LDPC) codes. The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers. Both components of the decoder are defined over the same sparse decoding graph enabling a seamless integration and scalability to large codes. The core idea is to use the GNN component between consecutive BP runs so that the knowledge from the previous BP run can be leveraged to better initialize the next BP run. This enables the proposed decoder to learn to compensate for sub-optimal BP decoding graphs that result from the design constraints of quantum LDPC codes. Since the entire decoder remains differentiable, gradient descent-based training is possible. We compare the error rate performance of the proposed decoder against various post-processing methods such as random perturbation, enhanced feedback, augmentation, and ordered-statistics decoding (OSD) and show that a carefully designed training process lowers the error-floor significantly. As a result, our proposed decoder outperforms the former three methods using significantly fewer post-processing attempts. The source code of our experiments is available online.
For recent years, deep learning has been studied and utilized among decoders in wireless and optical communication. For low density parity check (LDPC) codes, most works use neural network (NN) to implement the belief propagation (BP) decoder and unfold its iterations into layers activated by different functions. However, the whole decoder composed by neural network performs lots of non-linear operations, which are time consuming and unfriendly to hardware implementation. In this work, a neural network-aided normalized min-sum (NN-aided NMS) decoder for LDPC code is proposed, in which the normalization factors are inferred from input log likelihood ratio (LLR) by apre-trained NN, while maintaining check and variable nodes processing the same as in min-sum (MS) decoder. In order to test the proposed decoder with irregular LDPC code, a rate-7/8 one was constructed using progressive edge growth (PEG) algorithm, showing better error correction capability than the standard of consultative committee for space data systems (CCSDS) LDPC (8176,7154) code by 0.08 dB with the same rate. Simulation results show that, NN-aided NMS decoder outperforms MS decoder by 0.3 dB, and its performance approaches BP decoder with a gap of 0.02 dB, which is 50% closer than the best NMS decoder using 0.7 as the normalization factor. The proposed decoder has good performance for both regular and irregular LDPC codes, and needs much less computation complexity than BP decoder. It introduces more linear computation than NMS decoder but achieves better bit error rate (BER) performance, thus becoming a good complement between BP and NMS decoder when trading off among complexity, error correction performance and hardware implementation for wireless and satellite communication.
For the Belief Propagation (BP) algorithm of low-density parity-check (LDPC) codes, existing deep learning methods have a limited performance improvement and it is difficult to train deep-level networks. In this paper, a model-driven quasi-residual network (Quasi-ResNet) BP decoding architecture is proposed for LDPC codes to further improve the performance of standard BP decoding. This method feeds the reliable messages calculated in current iteration into the next iteration based on the shortcut connection, and adjusts the weight of shortcut connection based on the error Back Propagation algorithm of neural network to determine the optimal genetic proportion of reliable messages. The decoding architecture is composed of a model-driven deep neural network (DNN) and shortcut connection. Simulation results show that the decoder can not only unfold more layers quickly compared with the DNN-based BP decoder, but also further improve the decoding performance.