首页> 外文会议>International Workshop on Signal Design and its Applications in Communications >Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation Decoding Algorithms for LDPC Codes
【24h】

Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation Decoding Algorithms for LDPC Codes

机译:减少了复杂性和延迟的可变对剩余信念传播解码解码解码算法,用于LDPC代码

获取原文
获取外文期刊封面目录资料

摘要

This paper proposes some new improved versions of node-wise VCRBP algorithm, called forced-convergence node-wise VCRBP and sign-based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.
机译:本文提出了一些新的改进版本的Node-Wise VCRBP算法,称为强制融合节点WISE VCRBP和符号的节点WISE VCRBP,这两者都显着降低了解码复杂性和延迟,只能忽略不计纠错性能的恶化。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号