首页> 外国专利> METHOD FOR DESCRIBING DEVICES FOR CODING DATA BY RECURSIVE CONVOLUTION CODES

METHOD FOR DESCRIBING DEVICES FOR CODING DATA BY RECURSIVE CONVOLUTION CODES

机译:通过递归卷积码描述编码数据的设备的方法

摘要

The proposed method for describing devices for coding data by recursive convolution codes consists in presenting the input and the output data sequences as polynomials I(x) and C(x) with coefficients from set GF(q). The coding device is described as a device for multiplying polynomial I(x) by polynomials P1(x), P2(x), ..., Pm(x), which generate convolution code. The method is distinctive by using, in coding, polynomial h(x) with coefficients from set GF(q), which is used a the checking polynomial of cyclic code GF(qm) for set GF(qm), and the output sequence C(x) is formed by sequentially recording the coefficients of polynomial C(x)=I(x)/h(x), while performing the division operation in the sequence of set GF(qm)[x]/(xN-1), and mapping the said coefficients in set GF(q).
机译:所提出的用于描述通过递归卷积码对数据进行编码的设备的方法包括将输入和输出数据序列表示为多项式I(x)和C(x),其系数来自集合GF(q)。编码装置被描述为用于将多项式I(x)与多项式P1(x),P2(x),...,Pm(x)相乘的装置,其生成卷积码。该方法的独特之处在于,在编码中使用了系数为集合GF(q)的多项式h(x),该系数用于集合GF(qm)的循环码GF(qm)的校验多项式和输出序列C (x)通过依次记录多项式C(x)= I(x)/ h(x)的系数,同时按集合GF(qm)[x] /(xN-1)进行除法运算而形成,并将所述系数映射到集合GF(q)中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号