首页> 外文会议>IEEE/CIC International Conference on Communications in China >A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes
【24h】

A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes

机译:一种用于无出的脊柱代码的修改不调节的FANO顺序解码算法

获取原文

摘要

A modified unquantized Fano sequential decoding (MUFSD) algorithm for rateless spinal codes is proposed. The maximum storage space is introduced in MUFSD algorithm. When the number of stored nodes exceeds the storage space, the decoding is stopped immediately so that the decoding process can be controlled well. The calculated nodes are reserved at each forward calculation which reduces the computational complexity. An expression of the new branch metrics of spinal codes over additive white Gaussian noise (AWGN) channel are derived for the MUFSD algorithm. Simulation results show that the complexity and time consumption of the MUFSD algorithm for spinal codes are further reduced without sacrificing the rate performance compared with those of the bubble decoder and the forward stack decoding (FSD) algorithm. Particularly, in the case of low signal-to-noise ratio (SNR), the complexity and time consumption of the MUFSD algorithm are significantly decreased.
机译:提出了一种用于无出脊柱代码的修改的未调节FANO顺序解码(MUFSD)算法。以MUFSD算法引入最大存储空间。当存储节点的数量超过存储空间时,立即停止解码,以便控制解码过程。计算出的节点在每个前向计算时保留,这降低了计算复杂度。用于MUFSD算法导出了对添加性白色高斯噪声(AWGN)信道的新分支度量的表达。仿真结果表明,与气泡解码器和前向堆栈解码(FSD)算法相比,进一步降低了脊柱代码的MUFSD算法的复杂性和时间消耗,而不会牺牲速率性能。特别地,在低信噪比(SNR)的情况下,MUFSD算法的复杂性和时间消耗显着降低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号