首页> 外国专利> Method and device for the calculation of the syndrome, in particular to the codes hyperelliptic

Method and device for the calculation of the syndrome, in particular to the codes hyperelliptic

机译:用于计算校正子的方法和设备,特别是用于超椭圆码的校正子

摘要

The decoding method based on computing syndrome is for a code defined on a Galois body whose parity-check matrix H is of dimension (s+t)x(2N), where s, t and N are strictly positive integers, and a received code word R=(T U) is of length 2N, where T and U are row vectors of length N. The parity-check matrix H comprises as blocks a matrix Hs of dimensions sxN, and matrices HtM1 and HtM2, where the matrix Ht is of dimensions txN, and M1 and M2 are diagonal matrices of dimensions NxN. The syndrome characterizing an error to be corrected is given by S=H.RT, where the superscript T denotes the transposition. The first s symbols of the syndrome S are computed by evaluating a polynomial associated with the matrix T+U at the roots of polynomial generator of the matrix Hs, and the next t symbols of the syndrome S are computed by evaluating a polynomial associated with the matrix T.M1+U.M2 at the roots of polynomial generator of the matrix Ht. The evaluation steps implement the algorithm of Horner, and the code is hyperelliptic. The decoding device (claimed) comprises a counter of clock strokes, two read-only stores connected to the counter and representing N diagonal elements of the matrices M1 and M2, a first multiplication element multiplying the output of the first store with a symbol of the received word R of length 2N, a second multiplication element multiplying the output of the second store with a symbol of the received word R delayed by N clock strokes, a first addition element delivering the symbols corresponding to the matrix T.M1+U.M2, a second addition element delivering the symbols corresponding to the matrix U+T, a first circuit implementing the Corner algorithm connected to the second addition element for computing the first s elements of the syndrome S, and a second circuit implementing the Horner algorithm connected to the first addition element for computing the last t elements of the syndrome S. The two read-only stores are look-up tables, multiplexers, or combinatorial circuits. An apparatus (claimed) for digital signal processing comprises means for implementing the decoding method, or the decoding device. A telecommunication network (claimed) and a base station (claimed) comprise means for implementing the decoding method, or the decoding device.
机译:基于计算校正子的解码方法是针对在Galois主体上定义的代码,该代码的奇偶校验矩阵H的维数为(s + t)x(2N),其中s,t和N为严格的正整数,并且接收代码字R =(TU)的长度为2N,其中T和U是长度为N的行向量。奇偶校验矩阵H包括大小为sxN的矩阵Hs和矩阵HtM1和HtM2,其中矩阵Ht为尺寸txN,并且M1和M2是尺寸NxN的对角矩阵。 S = H.RT给出表征待纠正错误的校正子,其中上标T表示换位。通过在矩阵Hs的多项式生成器的根处评估与矩阵T + U关联的多项式来计算校正子S的前s个符号,并且通过评估与S关联的多项式来计算校正子S的后t个符号。矩阵Ht的多项式生成器的根处的矩阵T.M1 + U.M2。评估步骤实现了Horner算法,并且代码是超椭圆形的。解码设备(要求保护的)包括时钟笔划的计数器,连接到该计数器并表示矩阵M1和M2的N个对角元素的两个只读存储器,第一乘法元素将第一存储器的输出与符号M的符号相乘。接收长度为2N的字R,第二乘法元素将第二存储的输出与延迟了N个时钟脉冲的接收字R的符号相乘,第一加法元素提供对应于矩阵T.M1 + U.M2的符号;第二加法元件,其提供与矩阵U + T对应的符号;第一电路,其实现与所述第二加法元素相连的Corner算法,用于计算所述校正子S的第一s个元素;以及第二电路,其实现与Honer算法相连的第二电路用于计算校正子S的最后t个元素的第一个加法元素。两个只读存储区是查找表,多路复用器或组合电路。用于数字信号处理的设备(要求保护的)包括用于实现解码方法的装置或解码设备。电信网络(要求保护)和基站(要求保护)包括用于实施解码方法的装置或解码设备。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号