...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Telecommunication systems: Modeling, Analysis, Design and Management >Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis
【24h】

Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis

机译：通过最小化网格的卷积码的低复杂度网格表示

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

获取外文期刊封面封底 >>

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

摘要

It has been shown by McEliece and Lin that convolutional codes can be represented by a minimal trellis structure in order to reduce the decoding complexity of the Viterbi algorithm. This trellis module has an irregular structure presenting sections with different number of states. In this paper we present the sectionalization of the minimal trellis module which yields a more compact and regular trellis representation (in terms of maximum number of states and total number of sections) with the same decoding complexity and distance spectrum of the minimal trellis module. We investigate the effects of the trellis sectionalization over the trellis and merge complexity measures. A set of rules are constructed to govern these effects. A list of the most compact sectionalized trellis modules with the same complexities than the minimal module is shown for codes of several rates. We show that various trellis topologies proposed in the literature are specific cases of the sectionalized minimal trellis.
机译：McEliece和Lin已经证明，卷积码可以用最小的网格结构表示，以减少Viterbi算法的解码复杂度。该网格模块具有不规则的结构，呈现出状态数不同的部分。在本文中，我们介绍了最小网格模块的分段，它产生了更紧凑，更规则的网格表示（就最大状态数和节总数而言），并且具有与最小网格模块相同的解码复杂度和距离谱。我们调查了网格上的网格分段效果，并合并了复杂性度量。构建了一套规则来控制这些影响。对于几种速率的代码，显示了与最小模块具有相同复杂度的最紧凑的分段网格模块列表。我们表明，文献中提出的各种网格拓扑是分段最小网格的特定情况。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号