首页>
外国专利>
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 Sub >),它是在信息长度加上代码长度n的奇偶性为r位的代码长度为n的代码的每个代码长度n上的最小汉明距离(d min Sub>)的最大值,该信息单词有k位。获取最大d min Sub>变化的代码长度n,以及n的范围(n min Sub>≤ n≤ n max Sub>)被获取(S2)。在n的范围内,通过总搜索找到一直满足d min Sub> = Max.d min Sub>的生成多项式(G(x))(S3)。从总搜索(S4)找到的G(x)中选择代码的最小项数(w)和非检测错误概率(P ud Sub>)中的一个。 C)2006,日本特许厅
展开▼