| 欧几里德算法的RS译码研究及FPGA仿真 |
| |
| 引用本文： | 张天瑜.欧几里德算法的RS译码研究及FPGA仿真[J].武汉理工大学学报,2010(2). |
| |
| 作者姓名： | 张天瑜 |
| |
| 作者单位： | 无锡市广播电视大学机电工程系; |
| |
| 摘 要： | RS码在通信领域有着广泛的应用,其中最重要的是关键方程的求解。传统欧几里德算法是利用多项式长除法来求解关键方程,它需要多项式次数的判断,并且必须通过迭代运算才能求出商式和余式,造成硬件电路复杂,译码速度下降。通过矩阵论的相关知识,提出一种改进型欧几里德算法。它不需要进行多项式次数的判断和迭代运算就能快速地计算出商式和余式,能够降低译码的复杂度,提高译码速度。在VCS软件中通过FPGA仿真,仿真结果表明该算法能够实现正确译码的效果。
|
| 关 键 词： | RS码 关键方程 改进型欧几里德算法 FPGA仿真 |
Research of RS Decoding Based on Modified Euclidean Algorithm and FPGA Simulation |
| |
| ZHANG Tian-yu.Research of RS Decoding Based on Modified Euclidean Algorithm and FPGA Simulation[J].Journal of Wuhan University of Technology,2010(2). |
| |
| Authors: | ZHANG Tian-yu |
| |
| Affiliation: | ZHANG Tian-yu(Department of Mechanical , Electrical Engineering,Wuxi Radio & Television University,Wuxi 214011,China) |
| |
| Abstract: | Reed-Solomon(RS) code is widely used in the field of communication,of which the most important is solving key equation.Long division of polynomial is used to solve key equation in traditional Euclidean algorithm.The degree of polynomial needs judging.Moreover,quotient formula and remainder formula must be calculated by iterative computation,which will cause the complexity of hardware circuit and decrease the decoding speed.A modified Euclidean algorithm is proposed by the related knowledge of matrix theory.... |
| |
| Keywords: | reed-solomon code key equation modified euclidean algorithm FPGA simulation |
| 本文献已被 CNKI 等数据库收录！ |
|
