首页> 外文会议>International Workshop on Computer Science and Engineering >Algorithm of Low Complexity Viterbi Decoder in Convolutional Codes
【24h】

Algorithm of Low Complexity Viterbi Decoder in Convolutional Codes

机译:卷积码中低复杂度维特比解码器的算法

获取原文

摘要

Trellis of convolution codes has inherent symmetry and can be derived from generator sequences. By exploiting the inherent branch symmetry, the branch metric computation of the Viterbi decoder can be reduced significantly without any performance loss. Unfortunately, the butterfly structure only works for rate 1/n convolutional codes. Additionally, little is known in these studies. The study we present in the present paper is an attempt to supplement the findings of these earlies studies on the branch symmetry.
机译:卷积码的格子具有固有的对称性,可以从发电机序列中派生。通过利用固有的分支对称性,可以显着减小维特比解码器的分支度量计算而没有任何性能损失。不幸的是,蝴蝶结构仅适用于速率1 / N卷积码。此外,这些研究中只熟知。我们在本文中展示的研究是一种试图补充这些患病研究的研究结果对分支对称性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号