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

中国邮电高校学报：英文版

Novel modified min-sum decoding algorithm for low-density parity-check codes

Liu, Haiyang, Qu, Wen-ze, Li, Jiang-peng, Luo -, Shidong, Chen, Jie Jie

Published Jan 1, 2010• 1 citation
OpenAlex

Abstract

改进低密度的同等值检查(LDPC ) 译码编码的 min 和的表演的问题在这份报纸被考虑。把算法基于 min 和，为 LDPC 代码译码算法的新奇修改 min 和被建议。如果他们的符号是不同的，建议算法由平均新消息和以前的消息在重复进程修改可变节点消息。与标准 min 和算法相比，修正随仅仅复杂性的小增加被完成，但是显著地改善为常规、不规则的 LDPC 代码译码性能。模拟结果证明我们译码算法修改的性能离为中等长度 LDPC 代码的标准和产品算法的很靠近。

Related papers

Novel modified min-sum decoding algorithm for low-density parity-check codes

Haiyang Liu, Wenze Qu, Bin Liu +3 more

中国邮电高校学报：英文版•Aug 1, 2010•8 citations

Effects of clipping and quantization on min-sum algorithm and its modifications for decoding low-density parity-check (LDPC) codes

Jianguang Zhao

•Jan 1, 2003•1 citation

On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes

J. Zhao, Farhad Zarkeshvari, Amir H. Banihashemi

The effects of clipping and quantization on the performance of the min-sum algorithm for the decoding of low-density parity-check (LDPC) codes at short and intermediate block lengths are studied. It is shown that in many cases, only four quantization bits suffice to obtain close to ideal performance over a wide range of signal-to-noise ratios. Moreover, we propose modifications to the min-sum algorithm that improve the performance by a few tenths of a decibel with just a small increase in decoding complexity. A quantized version of these modified algorithms is also studied. It is shown that, when optimized, modified quantized min-sum algorithms perform very close to, and in some cases even slightly outperform, the ideal belief-propagation algorithm at observed error rates.

IEEE Transactions on Communications•Apr 1, 2005•283 citations

Low-Density Parity-Check(LDPC)decoder using low complexity min sum algorithm

nbspAnjitha, nbspProf Sadanandan G K

International Journal of Engineering Development and Research•Mar 1, 2016•0 citations

Intensity Reflection Coefficient Based Min-Sum Decoding for Low Density Parity Check Codes

Mohammad Rakibul Islam, Khandaker Sultan Mahmood, Md Farhan Tasnim Oshim +1 more

Abstract Low Density Parity Check Codes (LDPC) give groundbreaking performance which is known to approach Shannon’s limits for sufficiently large block length. Historically and recently, LDPC have been known to give superior performance than concatenated coding. In the following paper, a proposal to modify the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented. This is done by introduction of a factor, intensity reflection coefficient (IRC),

Frequenz•Jan 30, 2012•2 citations

Error floor properties of low-density parity-check codes using iterative decoding algorithms

Jianhua Lü

Error floor properties of low-density parity-check(LDPC)codes using different decoding algorithms were statistically analyzed utilizing test data from a hardware evaluation platform.The analysis shows that the number of residual error bits in an error codeword after decoding failure using the sum-product(SP)algorithm or the modified min-sum(MMS)algorithm is usually quite small;therefore,LDPC codes can serve as the inner code in a concatenated coding system to achieve an ultra low bit error rate.The analysis also shows that SP algorithm is more suitable for a concatenated coding system than MMS algorithm since less residual error bits occur when using the SP algorithm.Concatenated codes based on the analysis achieve bit error rates lower than 10-10 with a low decoding threshold.

Journal of Tsinghua University(Science and Technology)•Jan 1, 2009•0 citations
改进低密度的同等值检查(LDPC ) 译码编码的 min 和的表演的问题在这份报纸被考虑。把算法基于 min 和，为 LDPC 代码译码算法的新奇修改 min 和被建议。如果他们的符号是不同的，建议算法由平均新消息和以前的消息在重复进程修改可变节点消息。与标准 min 和算法相比，修正随仅仅复杂性的小增加被完成，但是显著地改善为常规、不规则的 LDPC 代码译码性能。模拟结果证明我们译码算法修改的性能离为中等长度 LDPC 代码的标准和产品算法的很靠近。
The effects of clipping and quantization on the performance of the min-sum algorithm for the decoding of low-density parity-check (LDPC) codes at short and intermediate block lengths are studied. It is shown that in many cases, only four quantization bits suffice to obtain close to ideal performance over a wide range of signal-to-noise ratios. Moreover, we propose modifications to the min-sum algorithm that improve the performance by a few tenths of a decibel with just a small increase in decoding complexity. A quantized version of these modified algorithms is also studied. It is shown that, when optimized, modified quantized min-sum algorithms perform very close to, and in some cases even slightly outperform, the ideal belief-propagation algorithm at observed error rates.
Error floor properties of low-density parity-check(LDPC)codes using different decoding algorithms were statistically analyzed utilizing test data from a hardware evaluation platform.The analysis shows that the number of residual error bits in an error codeword after decoding failure using the sum-product(SP)algorithm or the modified min-sum(MMS)algorithm is usually quite small;therefore,LDPC codes can serve as the inner code in a concatenated coding system to achieve an ultra low bit error rate.The analysis also shows that SP algorithm is more suitable for a concatenated coding system than MMS algorithm since less residual error bits occur when using the SP algorithm.Concatenated codes based on the analysis achieve bit error rates lower than 10-10 with a low decoding threshold.