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

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY

Average Magnitude Based Weighted Bit-flipping Decoding Algorithm for LDPC Codes

Gao-yuan Zhang, Liang Zhou, Wei-wei Su, Hong Wen

Published Feb 21, 2014• 1 citation
Publisher

Abstract

针对LDPC码的加权比特翻转(WBF)和改进型加权比特翻转(MWBF)算法，该文提出一种改进型算法。该方法以信息节点的平均幅度作为校验方程的可靠度信息，可以提高比特翻转效率。仿真结果表明，在AWGN信道下，误比特率为10-5时，相比于WBF和MWBF算法，该文提出的算法可分别获得约1.65 dB和1.36 dB的增益。同时，平均迭代次数分别降低18.20%~39.91%和17.54%~34.78%。

DOI
10.3724/sp.j.1146.2012.01728

Related papers

Sum of the magnitude based weighted bit-flipping decoding algorithms for LDPC codes

Zhang Gao-yua

Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.

Systems engineering and electronics•Jan 1, 2014•0 citations

An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes

Ming Yan Jiang, Chunming Zhao, Zhihua Shi +1 more

We present a major improvement to the modified weighted bit flipping (MWBF) decoding algorithm for low density parity-check (LDPC) codes. We improve the flipping criterion by introducing a more efficient method for computing the reliability of the parity checks. We derive an approximate theoretical expression for the weighting factor and demonstrate its consistency with simulation results. The improved MWBF algorithm achieves a noticeable gain over the MWBF algorithm with only a modest increase in computational complexity.

IEEE Communications Letters•Sep 1, 2005•153 citations

Iterative hybrid decoding algorithm for LDPC codes based on attenuation factor

Minghua, Liu, Lijun +1 more

为低密度的同等值检查(LDPC ) 译码算法编码的稀释反复的基于可靠性的多数逻辑(AIML ) 被建议，它与译码计划的混血儿相关。算法基于译码算法与一起的一步舞 majoritylogic (OSMLG ) 的直角的校验和被设计收到的符号的可靠性措施肯定。症候群和的可靠性措施的计算被介绍一个变细因素精制。模拟结果显示出那，在二进制输入的添加剂白人 Gaussian 噪音(BI-AWGN ) 隧道，译码算法的 AIML 超过随计算复杂性的细微增加译码算法的另外的流行反复的基于可靠性的多数逻辑(IML ) 。在 5 的最大的重复数字以内， AIML 算法能完成几乎相同的错误性能到和产品算法(矿泉) 。没有错误地板效果能为 AIML 算法被观察击倒到 108 的小点错误率(BER ) ，当错误地板在 BER 附近为矿泉出现时 107 甚至与 100 的最大的重复数字。而且，为 AIML 算法的平行行列的固有的特征与那些连续译码计划相对照强制译码的速度，例如加权扭动小点(WBF ) 算法。

Frontiers of Electrical and Electronic Engineering in China•Jan 1, 2012•0 citations

Weighted Symbol-flipping Decoding for Nonbinary LDPC Codes Based on a New Stopping Criterion

Bing Liu, Wei Tao, Gaoqi Dou +1 more

摘要: 为了降低多进制低密度奇偶校验(Low-Density Parity-Check,LDPC)码译码算法的复杂度,该文提出了基于新停止准则的符号翻转译码算法。该算法根据翻转函数和接收比特可靠性度量来确定对应的翻转符号,通过分析不满足校验方程个数的变化趋势来提前终止迭代。仿真结果表明,新算法在保持原有符号翻转译码算法误码性能不变的情况下,极大地减少了译码迭代次数,取得了译码性能和复杂度的折衷。 关键词: 多进制低密度奇偶校验码 / 符号翻转译码 / 停止准则 / 环路检测 / 有限域

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Mar 3, 2011•1 citation

Offset adjustment based weighted bit-flipping decoding algorithm for LDPC codes

Zhang Gao-yua

Extensive simulations show that for some low density parity-check(LDPC)codes of low row/colum weight,the modified sum of the magnitude based weighted bit flipping(MSMWBF)decoding algorithm performs extraordinarily well.However,this dose not hold when it comes to large row/colum weight finite-geometry LDPC codes,which is first theoretically analyzed.Secondly,improvement in performance is observed for large row/colum weight LDPC codes by considering an additive offset term for the parity-check-equation reliability of the above algorithm.Simulation results show that the performance of the improved scheme is better than that of the MSMWBF algorithm about 0.63 dB at bit-error rate of 10-5 over the additive white Gaussian noise channel with only a modest increase in computational complexity.

Systems engineering and electronics•Jan 1, 2014•0 citations

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

Ehsan Olyaei Torshizi, Mohammad Amir Nazari Siahsar, Ali Akbar Khazaei +1 more

Journal of advances in computer research•Feb 1, 2018•0 citations
针对LDPC码的加权比特翻转(WBF)和改进型加权比特翻转(MWBF)算法，该文提出一种改进型算法。该方法以信息节点的平均幅度作为校验方程的可靠度信息，可以提高比特翻转效率。仿真结果表明，在AWGN信道下，误比特率为10-5时，相比于WBF和MWBF算法，该文提出的算法可分别获得约1.65 dB和1.36 dB的增益。同时，平均迭代次数分别降低18.20%~39.91%和17.54%~34.78%。
Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.
We present a major improvement to the modified weighted bit flipping (MWBF) decoding algorithm for low density parity-check (LDPC) codes. We improve the flipping criterion by introducing a more efficient method for computing the reliability of the parity checks. We derive an approximate theoretical expression for the weighting factor and demonstrate its consistency with simulation results. The improved MWBF algorithm achieves a noticeable gain over the MWBF algorithm with only a modest increase in computational complexity.
为低密度的同等值检查(LDPC ) 译码算法编码的稀释反复的基于可靠性的多数逻辑(AIML ) 被建议，它与译码计划的混血儿相关。算法基于译码算法与一起的一步舞 majoritylogic (OSMLG ) 的直角的校验和被设计收到的符号的可靠性措施肯定。症候群和的可靠性措施的计算被介绍一个变细因素精制。模拟结果显示出那，在二进制输入的添加剂白人 Gaussian 噪音(BI-AWGN ) 隧道，译码算法的 AIML 超过随计算复杂性的细微增加译码算法的另外的流行反复的基于可靠性的多数逻辑(IML ) 。在 5 的最大的重复数字以内， AIML 算法能完成几乎相同的错误性能到和产品算法(矿泉) 。没有错误地板效果能为 AIML 算法被观察击倒到 108 的小点错误率(BER ) ，当错误地板在 BER 附近为矿泉出现时 107 甚至与 100 的最大的重复数字。而且，为 AIML 算法的平行行列的固有的特征与那些连续译码计划相对照强制译码的速度，例如加权扭动小点(WBF ) 算法。
摘要: 为了降低多进制低密度奇偶校验(Low-Density Parity-Check,LDPC)码译码算法的复杂度,该文提出了基于新停止准则的符号翻转译码算法。该算法根据翻转函数和接收比特可靠性度量来确定对应的翻转符号,通过分析不满足校验方程个数的变化趋势来提前终止迭代。仿真结果表明,新算法在保持原有符号翻转译码算法误码性能不变的情况下,极大地减少了译码迭代次数,取得了译码性能和复杂度的折衷。 关键词: 多进制低密度奇偶校验码 / 符号翻转译码 / 停止准则 / 环路检测 / 有限域
Extensive simulations show that for some low density parity-check(LDPC)codes of low row/colum weight,the modified sum of the magnitude based weighted bit flipping(MSMWBF)decoding algorithm performs extraordinarily well.However,this dose not hold when it comes to large row/colum weight finite-geometry LDPC codes,which is first theoretically analyzed.Secondly,improvement in performance is observed for large row/colum weight LDPC codes by considering an additive offset term for the parity-check-equation reliability of the above algorithm.Simulation results show that the performance of the improved scheme is better than that of the MSMWBF algorithm about 0.63 dB at bit-error rate of 10-5 over the additive white Gaussian noise channel with only a modest increase in computational complexity.