首页> 外文会议>Applied Algebra, Algebraic Algorithms and Error-Correcting Codes >Properties of Finite Response Input Sequences of Recursive Convolutional Codes
【24h】

Properties of Finite Response Input Sequences of Recursive Convolutional Codes

机译:递归卷积码的有限响应输入序列的性质

获取原文

摘要

A recursive convolutional encoder can be regarded as an infinite impulse response system over the Galois Field of order 2. First, in this paper, we introduce finite response input sequences for recursive convolutional codes that give finite weight output sequences. In practice, we often need to describe the finite response sequence with a certain Hamming weight. Then, different properties of finite response input sequences are presented. It is shown that all finite response input sequences with a certain Hamming weight can be obtained in closed-form expressions from the so-called basic sequences. These basic sequences are presented for important recursive convolutional encoders and some possible applications are given .
机译:递归卷积编码器可以看作是2阶Galois场上的无限脉冲响应系统。首先,在本文中,我们介绍了递归卷积码的有限响应输入序列,该序列给出了有限的权重输出序列。在实践中,我们经常需要描述具有一定汉明权重的有限响应序列。然后,给出了有限响应输入序列的不同性质。结果表明,具有一定汉明权重的所有有限响应输入序列都可以从所谓的基本序列以闭式形式获得。这些基本序列被提出用于重要的递归卷积编码器,并给出了一些可能的应用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号