【24h】

Iterative Chase-2 Algorithm using Threshold for Block Turbo Codes Decoding Design

机译:门限的迭代Chase-2算法在块Turbo码译码设计中的应用

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we introduce an approach to get better performance of block turbo codes (BTCs). We use threshold to limit the search for the maximum-likelihood codeword. Consequently, by using chase-2 algorithm, Euclidean distance will be calculated from smaller group of candidate codeword, and we can calculate reliability and extrinsic information easier and faster. So a faster iterative decoding process is achieved to take these extra threshold calculations into chase-2 algorithm for BTCs. We evaluate the performance of this decoding process on additive white Gaussian noise (AWGN) channel. And decoding complexity reduces a lot over the standard iterative decoding methods. We also add this idea into the hardware design of BTCs decoder. It also shows good reduction for number of operations.
机译:在本文中,我们介绍了一种获得更好的块Turbo码(BTC)性能的方法。我们使用阈值来限制对最大似然码字的搜索。因此,通过使用chase-2算法,可以从较小组的候选码字中计算出欧几里得距离,从而可以更轻松,更快速地计算出可靠性和外在信息。因此,实现了更快的迭代解码过程,将这些额外的阈值计算带入BTC的chase-2算法中。我们评估加性高斯白噪声(AWGN)信道上此解码过程的性能。与标准的迭代解码方法相比,解码复杂度降低了很多。我们还将这一想法添加到BTC解码器的硬件设计中。它还显示出操作次数的良好减少。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号