摘要
为了简化数字电视译码电路的复杂性,提出一种改进型欧几里德算法.该算法利用多项式带余除法的相关推论,通过矩阵的列变换来求解关键方程,这样可以快速地得到商式和余式,从而可以减少迭代运算的次数.与传统欧几里德算法相比,该算法在求解关键方程的过程中能够更方便地得到错误值多项式和错误位置多项式,并且能够减少硬件电路的复杂性,提高RS码的译码速度.
To simplify the complexity of digital TV decoding circuit, a modified Euclidean algorithm is proposed. The proposed algorithm use the related deduction of division with reminder of polynomials and the key equation is solved by column transformation of matrix. Then the formula of quotient and reminder can be got quickly which can reduce the times of iterative operation. Compared with the traditional Euclidean algorithm, the proposed algorithm can easily get error value polynomial and error locator polynomial in the process of solving the key equation. Moreover, it can simplify the complexity of hardware circuit and improve RS decoding speed.
出处
《武汉工程大学学报》
CAS
2009年第12期73-78,共6页
Journal of Wuhan Institute of Technology
关键词
RS码
多项式带余除法
关键方程
改进型欧几里德算法
列变换
Reed-Solomon code
division with reminder of polynomials
key equation
modified Euclidean algorithm
column transformation
