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

A Check Nodes Correction Approximate Min-sum Decoding Algorithm For LDPC

Ruizhen Wu, Lin Wang, Tao Yuan, Xiaoyong Zhang

Published Jul 1, 2019• 1 citation
Publisher

Abstract

A check nodes correction approximate Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found to do expansion and optimization based on hardware working manner. The decoding algorithm summarized a correction approximate algorithm based on different SNR situations and hardware implementation. The simulation is based on LDPC NR 3GPP 38.212 release and the comparison results showed the proposed check nodes correction approximate Min-sum decoding algorithm can have a better BER and iteration time performance. The hardware of this proposed algorithm is based on Min-sum decoder and the extra cost is only a shifter and an adder besides the memory.

DOI
10.1109/icoict.2019.8835237

Related papers

A Configurable Approximation Min-Sum Decoding Algorithm for Low Density Parity Check Codes

Ruizhen Wu, Lin Wang, Mingming Wang

A configurable approximation Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found and optimized based on Jacobian Logarithm and hardware working mode. The decoding algorithm is configurable to satisfy different environment's need and will only need update the variable memory. The simulation is based on LDPC NR 3GPP 38.212 release and the comparison results showed the proposed configurable approximation Min-sum decoding algorithm have a better BER performance. The hardware of this proposed algorithm is based on Min-sum decoder and the extra cost is only a shifter and an adder besides the configurable memory.

International Conference on Information Communication and Management (ICICM)•Aug 23, 2019•0 citations

A sectional degree match approximate Min-sum decoding algorithm for LDPC

Ruizhen Wu, Lin Wang, Tao Yuan +1 more

A sectional degree match approximate Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor from BP to MS is analyzed and a proposal to offset it, is explained, with expansion and optimization based on principles of hardware implementation. The decoding algorithm summarizes three correction approximate algorithms considering different LLR values, matrix degrees and rules of hardware implementation. Simulation is following LDPC NR 3GPP 38.212 release and the comparison results demonstrate that the proposed sectional degree match approximate Min-sum decoding algorithm has a better BER and less iteration time. The hardware implementation of this algorithm is strived from Min-Sum decoder and the extra cost is minor besides the memory.

IEEE 5G World Forum (5GWF)•Sep 1, 2019•0 citations

Modified min-sum decoding algorithm for LDPC codes based on classified correction

Zhong Zhou, Yunzhou Li, Xiang Chen +2 more

In this paper, a modified min-sum decoding algorithm based on classified correction is proposed for low density parity check (LDPC) codes. Different from the single correction in the normalized belief propagation (BP)-based and offset BP-based algorithms [4], the proposed algorithm utilizes two corrections for both minimum and sub-minimum magnitudes of input messages in check nodes. These two correction factors can be obtained by analyzing the offset of updated messages in check nodes between the BP and the min-sum algorithms associated with check node degree. Simulation results show that the proposed algorithm can achieve performance very close to that of the BP algorithm. Furthermore, the FPGA implementation of this algorithm can reach a throughput of 200 Mbps at BER=10-6with lower complexity and fewer resources than the BP algorithm.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2008•9 citations

Efficient LDPC Decoding Algorithm Based on Min-sum

Jingao Liu

To improve the decoding performance of Low Density Parity Check(LDPC) code,an efficient decoding algorithm based on min-sum algorithm is proposed. The proposed algorithm analyzes the check node update equation and at the view of probability to form an approximation min-sum equation. It adopts a dynamic normalization factor to improve the decoding performance. Detailed simulation results and comparisons with Belief Propagation(BP) algorithm show that,with little decoding performance loss,the proposed algorithm not only decreases computational load,but also improves decoding efficiency.

Jisuanji gongcheng•Jan 1, 2009•0 citations

A modified Offset Min-Sum decoding algorithm for LDPC codes

Meng Xu, Jianhui Wu, Meng Zhang

In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.

•Jul 1, 2010•29 citations

An improved normalized min-sum algorithm for LDPC codes

Jinlei Chen, Yan Zhang, Ruiyi Sun

An improved normalized min-sum (IN-MS) algorithm is proposed for decoding low-density parity-check (LDPC) codes. In this algorithm, two normalized factors are used in check node computing, one for the minimum data and another for the second minimum data, and this algorithm achieves a better approximation to the BP algorithm. Simulation results show that the decoding performance of IN-MS algorithm is better than that of the normalized min-sum (NMS) algorithm.

IEEE/ACIS International Conference on Computer and Information Science (ICIS)•Jun 1, 2013•9 citations
A check nodes correction approximate Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found to do expansion and optimization based on hardware working manner. The decoding algorithm summarized a correction approximate algorithm based on different SNR situations and hardware implementation. The simulation is based on LDPC NR 3GPP 38.212 release and the comparison results showed the proposed check nodes correction approximate Min-sum decoding algorithm can have a better BER and iteration time performance. The hardware of this proposed algorithm is based on Min-sum decoder and the extra cost is only a shifter and an adder besides the memory.
A configurable approximation Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found and optimized based on Jacobian Logarithm and hardware working mode. The decoding algorithm is configurable to satisfy different environment's need and will only need update the variable memory. The simulation is based on LDPC NR 3GPP 38.212 release and the comparison results showed the proposed configurable approximation Min-sum decoding algorithm have a better BER performance. The hardware of this proposed algorithm is based on Min-sum decoder and the extra cost is only a shifter and an adder besides the configurable memory.
A sectional degree match approximate Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor from BP to MS is analyzed and a proposal to offset it, is explained, with expansion and optimization based on principles of hardware implementation. The decoding algorithm summarizes three correction approximate algorithms considering different LLR values, matrix degrees and rules of hardware implementation. Simulation is following LDPC NR 3GPP 38.212 release and the comparison results demonstrate that the proposed sectional degree match approximate Min-sum decoding algorithm has a better BER and less iteration time. The hardware implementation of this algorithm is strived from Min-Sum decoder and the extra cost is minor besides the memory.
In this paper, a modified min-sum decoding algorithm based on classified correction is proposed for low density parity check (LDPC) codes. Different from the single correction in the normalized belief propagation (BP)-based and offset BP-based algorithms [4], the proposed algorithm utilizes two corrections for both minimum and sub-minimum magnitudes of input messages in check nodes. These two correction factors can be obtained by analyzing the offset of updated messages in check nodes between the BP and the min-sum algorithms associated with check node degree. Simulation results show that the proposed algorithm can achieve performance very close to that of the BP algorithm. Furthermore, the FPGA implementation of this algorithm can reach a throughput of 200 Mbps at BER=10-6with lower complexity and fewer resources than the BP algorithm.
To improve the decoding performance of Low Density Parity Check(LDPC) code,an efficient decoding algorithm based on min-sum algorithm is proposed. The proposed algorithm analyzes the check node update equation and at the view of probability to form an approximation min-sum equation. It adopts a dynamic normalization factor to improve the decoding performance. Detailed simulation results and comparisons with Belief Propagation(BP) algorithm show that,with little decoding performance loss,the proposed algorithm not only decreases computational load,but also improves decoding efficiency.
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.