...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Technology Journal >Performance Evaluation of Sum Product and Min-sum Stopping Node Algorithm for LDPC Decoding
【24h】

Performance Evaluation of Sum Product and Min-sum Stopping Node Algorithm for LDPC Decoding

机译：LDPC解码的和积和最小和停止节点算法的性能评估

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Because of the excellent error- correcting capability and optional error correct code, Low-Density Parity-Check (LDPC) codes have received great attention recently. LDPC codes can be decoded by an iterative decoding algorithm as Belief Propagation Algorithm or Message Passing Algorithm. In this paper, the extended analysis of Sum-Product algorithm (SPA) and Min-Sum algorithm (MSA) using Stopping node method is introduced. This method based on SPA using stopping node to reduce the computing complexity on LDPC code is presented, and it has also been proposed to be applied to MSA. Moreover, how to remove the effect of short cycles to improve the quality of LDPC decoder and how to make early decisions on the next iteration to reduce the number of calculations are presented in this paper. Simulations show that the stopping node algorithm not only offers a better performance but also decreases processing time by factor of 5 times under BPSK scheme and nearly 10 times under QPSK scheme by comparison with standard MSA and SPA.
机译：由于出色的纠错能力和可选的纠错码，低密度奇偶校验（LDPC）码最近受到了广泛的关注。 LDPC码可以通过迭代解码算法（如置信传播算法或消息传递算法）进行解码。本文介绍了使用停止节点法对Sum-Product算法（SPA）和Min-Sum算法（MSA）的扩展分析。提出了一种基于SPA的，使用停止节点的方法来降低LDPC码的计算复杂度的方法，并将其应用于MSA。此外，本文还介绍了如何消除短周期的影响以提高LDPC解码器的质量，以及如何对下一次迭代做出早期决策以减少计算量。仿真表明，与标准MSA和SPA相比，停止节点算法不仅性能更好，而且在BPSK方案下处理时间减少了5倍，在QPSK方案下减少了近10倍。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号