...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Some new rate R=k (2>or=k>or=n-2) systematic convolutional codes with good distance profiles
【24h】

Some new rate R=k (2>or=k>or=n-2) systematic convolutional codes with good distance profiles

机译：一些具有良好距离分布的新速率R = k / n（2> or = k> or = n-2）系统卷积码

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Seven new systematic convolutional codes with good distance profiles, mostly of rates not previously investigated, have been found. New systematic convolutional codes of rates R=k, 4>or=n>or=7, 2>or=kn-2, are presented together with their free distances and first few values of the distance spectra. These codes have rapidly growing column distance functions and are intended for sequential decoding. The new codes were found by a nested step-by-step computer search, similar to the procedure introduced by S. Lin and H. Lyne (1967). The computational load of the search is an important factor which determined how far it was possible to extend the constraint length of the codes. This load grows exponentially during the first phase of the search. It reaches a maximum about halfway through the search, as is shown by an example. The new codes found are presented in tables.
机译：已经发现了七个具有良好距离分布的新的系统卷积码，其中大多数没有以前研究过的速率。提出了速率为R = k / n，4> or = n> or = 7、2> or = kn-2的新系统卷积码及其自由距离和距离谱的前几个值。这些代码具有快速增长的列距功能，旨在用于顺序解码。新的代码是通过嵌套的逐步计算机搜索找到的，类似于S. Lin和H. Lyne（1967）引入的过程。搜索的计算量是一个重要因素，它决定了可以将代码的约束长度扩展到多远。在搜索的第一阶段，此负载呈指数增长。如示例所示，它在搜索的一半左右达到最大值。表格中显示了找到的新代码。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号