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

Haiyang Liu, Wenze Qu, Bin Liu, Jiangpeng Li, Shi-dong LUO, Jie Chen

Published Aug 1, 2010• 8 citations
Publisher
DOI
10.1016/s1005-8885(09)60479-9

Related papers

Optimization of the min-sum decoding algorithm for low-density parity-check codes

V. Sh. Le

Труды Московского физико-технического института•Jan 1, 2021•1 citation

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•289 citations

Improved Min-Sum Decoding Algorithm for Moderate Length Low Density Parity Check Codes

Waheed Ullah, Jiangtao, Yang FengFan

Lecture notes in electrical engineering•Nov 28, 2011•8 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

A modified Min-Sum algorithm for low-density parity-check codes

Wei Han, Jianguo Huang, WU Fang-fei

A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.

Wireless Communications, Networking and Information Security•Jun 1, 2010•9 citations
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.
A modified Min-Sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the Min-Sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized Min-Sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified Min-Sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the Min-Sum algorithm while added complexity slightly.