首页> 外国专利> SELECTING METHOD OF CRC GENERATOR POLYNOMIAL, CRC ENCODING METHOD, AND CRC ENCODING CIRCUIT

SELECTING METHOD OF CRC GENERATOR POLYNOMIAL, CRC ENCODING METHOD, AND CRC ENCODING CIRCUIT

机译:CRC发生器多项式的选择方法,CRC编码方法和CRC编码电路

摘要

PROBLEM TO BE SOLVED: To select a generator polynomial G(x) suitable for a CRC encoding circuit.;SOLUTION: In the selecting method of a CRC generator polynomial, maximum and minimum hamming distance (Max.dmin) is acquired which is maximum value of minimum hamming distance (dmin) at each code length n of the codes with code length n added with a parity of r bit for information words, with the information word having k bit. The code length n is acquired in which Max.dmin changes, and the range of n (nmin≤n≤nmax) is acquired (S2). In the range of n, the generator polynomial (G(x)) which satisfies dmin=Max.dmin at all times is found by total searching (S3). The one of minimum number of terms (w) and non-detection error probability (Pud) of code is selected from among G (x) found by the total searching (S4).;COPYRIGHT: (C)2006,JPO&NCIPI
机译:解决的问题:选择适用于CRC编码电路的生成多项式G(x).;解决方案:在CRC生成多项式的选择方法中,最大和最小汉明距离(Max.d min ),它是在信息长度加上代码长度n的奇偶性为r位的代码长度为n的代码的每个代码长度n上的最小汉明距离(d min )的最大值,该信息单词有k位。获取最大d min 变化的代码长度n,以及n的范围(n min ≤ n≤ n max )被获取(S2)。在n的范围内,通过总搜索找到一直满足d min = Max.d min 的生成多项式(G(x))(S3)。从总搜索(S4)找到的G(x)中选择代码的最小项数(w)和非检测错误概率(P ud )中的一个。 C)2006,日本特许厅

著录项

  • 公开/公告号JP2006180172A

    专利类型

  • 公开/公告日2006-07-06

    原文格式PDF

  • 申请/专利权人 SONY CORP;

    申请/专利号JP20040370796

  • 申请日2004-12-22

  • 分类号H03M13/09;

  • 国家 JP

  • 入库时间 2022-08-21 21:51:29

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号