首页> 外文会议>International Conference on Computing Communication and Networking Technologies >Adaptive reliability-based iteration min-sum decoding algorithm for majority-logic decodable LDPC codes
【24h】

Adaptive reliability-based iteration min-sum decoding algorithm for majority-logic decodable LDPC codes

机译:适用于多数逻辑可解码LDPC码的基于可靠性的迭代最小和解码算法

获取原文

摘要

In this paper, an adaptive decoding algorithm for majority-logic decodable LDPC codes is present based on a recent work by Chen et al. Different from the RBI-MSD algorithm, the presented adaptive reliability-based iteration min-sum decoding algorithm does not need to predesignate the scaling factor, which is optimized by discretized density evolution. In the adaptive RBIMSD algorithm, an adaptive scaling factor is induced for each check node to modify the extrinsic message. The adaptive scaling factor is computed by the ratio of the second minimum and the maximum value among the message, which is received by the check nodes. Simulation results show that, the performance of the adaptive RBI-MSD algorithm is almost as well as that of the original RBI-MSD algorithm but with a little (or negligible) computation increase.
机译:本文基于Chen等人的最新工作,提出了一种适用于多数逻辑可解码LDPC码的自适应解码算法。与RBI-MSD算法不同,本文提出的基于可靠性的自适应迭代最小和解码算法无需预先指定缩放因子,而缩放因子是通过离散化密度演化进行优化的。在自适应RBIMSD算法中,为每个校验节点引入自适应缩放因子以修改外部消息。通过校验节点接收到的消息中第二最小值和最大值之比来计算自适应缩放因子。仿真结果表明,自适应RBI-MSD算法的性能几乎与原始RBI-MSD算法相同,但计算量却有所增加(或可忽略不计)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号