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

Application of Serial Min-max Decoding Algorithm Based on Variable Weighting for Nonbinary LDPC Codes in Optical Communication

Zhongxun Wang, Xinglong Gao

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

Abstract: In this paper, we perform an analysis on the min-max decoding algorithm for nonbinary LDPC (lowdensity parity-check) codes and propose serial min-max decoding algorithm. After that, combining with the weighted processing of the variable node message, we propose serial min-max decoding algorithm based on variable weighting for nonbinary LDPC codes. In the end, we perform a detailed analysis on the features of optical communication and show the simulation model in optical communication system. The simulation indicates that when the bit error rate is 10-3 and used in optical communication, compared with serial min-max decoding algorithm, traditional min-max decoding algorithm and traditional min-sum algorithm, serial min-max decoding algorithm based on variable weighting can offer additional coding gain 0.2 dB, 0.3 dB and 0.4 dB respectively in (AWGN) additional white Gaussian noise channel and under (OOK) on-off keying modulation. Copyright © 2013 IFSA.

Related papers

Serial Min-max Decoding Algorithm Based on Variable Weighting for Nonbinary LDPC Codes

Zhongxun Wang, Xinglong Gao, Tiancheng Chen

In this paper, we perform an analysis on the min-max decoding algorithm for nonbinary LDPC (low-density parity-check) codes and propose serial min-max decoding algorithm. Combining with the weighted processing of the variable node message, we propose serial min-max decoding algorithm based on variable weighting for nonbinary LDPC codes in the end. The simulation indicates that when the bit error rate is 10^-3, compared with serial min-max decoding algorithm, traditional min-max decoding algorithm and traditional minsum algorithm, serial min-max decoding algorithm based on variable weighting can offer additional coding gain 0.2dB、0.8dB and 1.4dB respectively in additional white Gaussian noise channel and under binary phase shift keying modulation.

TELKOMNIKA Indonesian Journal of Electrical Engineering•Dec 2, 2013•0 citations

The Min-max Decoding Algorithm of Nonbinary

Zhongxun Wang, Xinglong Gao

In this paper, we propose the min-max decoding algorithm of nonbinary LDPC codes based on early stopping by analyzing and combining traditional min-max decoding algorithm of nonbinary LDPC codes and the early stopping rule of binary LDPC codes. The simulation indicates that the proposed algorithm can greatly reduce the number of iterations in decoding process with almost no decoding performance loss compared with traditional minsum decoding algorithm of nonbinary LDPC codes and traditional min-max decoding algorithm of nonbinary LDPC codes in low signal-to-noise ratio region , which is in additive Gaussian white noise channel and under binary phase shift keying modulation. So the computational complexity can be effectively reduced and the real-time performance can be well improved.

Journal of Computers•Oct 30, 2014•0 citations

Application of nonbinary LDPC codes about serial decoding algorithm in optical fiber communication

Mingyang Chen

This paper use serial BP decoding algorithm to decode nonbinary LDPC codes in order to reduce decoding latency in optical fiber communication system.Then we introduce the serial BP decoding algorithm for nonbinary LDPC codes and the simulation model of optical communication system in detail.After that we show the performance effect of the maximum iterations of serial BP decoding algorithm in LDPC decoder and compare the performance of the decoder with traditional BP decoding algorithm and serial BP decoding algorithm.The result indicates that serial BP decoding algorithm can really increase the convergence speed of LDPC decoder.

Optical Communication Technology•Jan 1, 2013•0 citations

Differential Decoding of Low-Density Parity-Check Codes Based on Min Sum Algorithm

Shizhang Peng, Zemao Zhao, Jianrong Bao

To improve performance and reduce computation complexity of the low-density parity-check (LDPC) codes, a min-sum based differential decoding algorithm is proposed. The main principle is that the messages passing in the bipartite graph of the codes are the probability differences and the updates of the check nodes adopt min sum algorithm. Simulation results show that the proposed algorithm can achieve about 0.4dB performance gain over the UMP BP-Based decoding algorithm at bit error rate (BER) of under an additive white Gaussian noise (AWGN) channel. And it can obtain good performance very close to that of the BP decoding algorithm with much lower complexity.

International Symposium on Information Science and Engineering•Dec 1, 2010•2 citations

Research of Multi-Rate LDPC Decoding in Optical Communication System

Wenhao Jin, Chunwu Liu

Low-density parity-check code (LDPC) not only has good performance approaching the Shannon limit, but also has low decoding complexity and flexible structure. It is a research hot-spot in the field of channel coding in recent years and has a wide range of application prospects in optical communication systems. In this paper, the decoding aspects and performance of LDPC codes are analyzed and compared according to the bit error rate (BER) of LDPC codes. The computer simulation was carried out under additive white Gaussian noise (AWGN) channel and binary phase shift keying (BPSK) modulation. Through theoretical analysis and simulation results, this paper explores the way of multi-rate LDPC decoding.

Optics and Photonics Journal•Jan 1, 2020•1 citation

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jul 1, 2009•1 citation
Abstract: In this paper, we perform an analysis on the min-max decoding algorithm for nonbinary LDPC (lowdensity parity-check) codes and propose serial min-max decoding algorithm. After that, combining with the weighted processing of the variable node message, we propose serial min-max decoding algorithm based on variable weighting for nonbinary LDPC codes. In the end, we perform a detailed analysis on the features of optical communication and show the simulation model in optical communication system. The simulation indicates that when the bit error rate is 10-3 and used in optical communication, compared with serial min-max decoding algorithm, traditional min-max decoding algorithm and traditional min-sum algorithm, serial min-max decoding algorithm based on variable weighting can offer additional coding gain 0.2 dB, 0.3 dB and 0.4 dB respectively in (AWGN) additional white Gaussian noise channel and under (OOK) on-off keying modulation. Copyright © 2013 IFSA.
In this paper, we perform an analysis on the min-max decoding algorithm for nonbinary LDPC (low-density parity-check) codes and propose serial min-max decoding algorithm. Combining with the weighted processing of the variable node message, we propose serial min-max decoding algorithm based on variable weighting for nonbinary LDPC codes in the end. The simulation indicates that when the bit error rate is 10^-3, compared with serial min-max decoding algorithm, traditional min-max decoding algorithm and traditional minsum algorithm, serial min-max decoding algorithm based on variable weighting can offer additional coding gain 0.2dB、0.8dB and 1.4dB respectively in additional white Gaussian noise channel and under binary phase shift keying modulation.
In this paper, we propose the min-max decoding algorithm of nonbinary LDPC codes based on early stopping by analyzing and combining traditional min-max decoding algorithm of nonbinary LDPC codes and the early stopping rule of binary LDPC codes. The simulation indicates that the proposed algorithm can greatly reduce the number of iterations in decoding process with almost no decoding performance loss compared with traditional minsum decoding algorithm of nonbinary LDPC codes and traditional min-max decoding algorithm of nonbinary LDPC codes in low signal-to-noise ratio region , which is in additive Gaussian white noise channel and under binary phase shift keying modulation. So the computational complexity can be effectively reduced and the real-time performance can be well improved.
This paper use serial BP decoding algorithm to decode nonbinary LDPC codes in order to reduce decoding latency in optical fiber communication system.Then we introduce the serial BP decoding algorithm for nonbinary LDPC codes and the simulation model of optical communication system in detail.After that we show the performance effect of the maximum iterations of serial BP decoding algorithm in LDPC decoder and compare the performance of the decoder with traditional BP decoding algorithm and serial BP decoding algorithm.The result indicates that serial BP decoding algorithm can really increase the convergence speed of LDPC decoder.
To improve performance and reduce computation complexity of the low-density parity-check (LDPC) codes, a min-sum based differential decoding algorithm is proposed. The main principle is that the messages passing in the bipartite graph of the codes are the probability differences and the updates of the check nodes adopt min sum algorithm. Simulation results show that the proposed algorithm can achieve about 0.4dB performance gain over the UMP BP-Based decoding algorithm at bit error rate (BER) of under an additive white Gaussian noise (AWGN) channel. And it can obtain good performance very close to that of the BP decoding algorithm with much lower complexity.
Low-density parity-check code (LDPC) not only has good performance approaching the Shannon limit, but also has low decoding complexity and flexible structure. It is a research hot-spot in the field of channel coding in recent years and has a wide range of application prospects in optical communication systems. In this paper, the decoding aspects and performance of LDPC codes are analyzed and compared according to the bit error rate (BER) of LDPC codes. The computer simulation was carried out under additive white Gaussian noise (AWGN) channel and binary phase shift keying (BPSK) modulation. Through theoretical analysis and simulation results, this paper explores the way of multi-rate LDPC decoding.
Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1