|本期目录/Table of Contents|

[1]张天瑜.数字电视译码电路中改进型欧几里德算法[J].武汉工程大学学报,2009,(12):73-78.
　ZHANG Tian yu.Modified Euclidean algorithm in digital TV decoding circuit[J].Journal of Wuhan Institute of Technology,2009,(12):73-78.
点击复制

数字电视译码电路中改进型欧几里德算法(/HTML)
分享到：

《武汉工程大学学报》[ISSN:1674-2869/CN:42-1779/TQ]

卷:
期数:
2009年12期
页码:
73-78
栏目:
机电与信息工程
出版日期:
2009-12-28

文章信息/Info

Title:

Modified Euclidean algorithm in digital TV decoding circuit
文章编号:
16742869(2009)12007306
作者:
张天瑜
无锡市广播电视大学机电工程系，江苏 无锡 214011
Author(s):
ZHANG Tianyu
Department of Mechanical and Electrical Engineering, Wuxi Radio & Television University,
Wuxi 214011, China
关键词:
RS码; 多项式带余除法; 关键方程; 改进型欧几里德算法; 列变换
Keywords:
ReedSolomon code;  division with reminder of polynomials;  key equation;  modified Euclidean algorithm;  column transformation
分类号:
TN 943
DOI:
-
文献标志码:
A
摘要:
为了简化数字电视译码电路的复杂性，提出一种改进型欧几里德算法.该算法利用多项式带余除法的相关推论，通过矩阵的列变换来求解关键方程，这样可以快速地得到商式和余式，从而可以减少迭代运算的次数.与传统欧几里德算法相比，该算法在求解关键方程的过程中能够更方便地得到错误值多项式和错误位置多项式，并且能够减少硬件电路的复杂性，提高RS码的译码速度.
Abstract:
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.

参考文献/References:

［1］Wu Y Q. New list decoding algorithms for ReedSolomon and BCH codes ［J］. IEEE Transactions on Information Theory, 2008,54(8):36113630.
［2］Krachkovsky V Y, Ashley J J, Williamson C J, et al. Syndrome ReedSolomon decoding using bit reliabilities ［J］. IEEE Transactions on Magnetics, 2008,44(1):223227.
［3］Albanese M, Spalvieri A. Two algorithms for softdecision decoding of ReedSolomon codes, with application to multilevel coded modulations ［J］. IEEE Transactions on Communications, 2008,56(10):15691574.
［4］Kang K. Probabilistic analysis of data interleaving for ReedSolomon coding in BCMCS ［J］. IEEE Transactions on Wireless Communications, 2008,7(10):38783888.
［5］刘军, 刘黎志, 黄浩. 一种无线嵌入式数字卫星接收系统的模块化设计 ［J］. 武汉工程大学学报, 2008,30(4):99102.［6］刘书, 潘成胜, 张德育. Mobile Agent在网络系统监控中数据采集的设计与应用 ［J］. 武汉工程大学学报, 2009,31(3):7780.
［7］Lee K, O’Sullivan M E. List decoding of ReedSolomon codes from a Grbner basis perspective ［J］. Journal of Symbolic Computation, 2008,43(9):645658.
［8］Chang Y W, Jeng J H, Truong T K. An efficient Euclidean algorithm for ReedSolomon code to correct both errors and erasures ［C］. IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, Victoria, Canada, 2003:895898.
［9］Chang Y W, Truong T K., Jeng J H. VLSI architecture of modified Euclidean algorithm for ReedSolomon Code ［J］. Information Sciences, 2003,155(12):139150.
［10］Lee S, Lee H, Shin J, et al. A highspeed pipelined degreecomputationless modified Euclidean algorithm architecture for ReedSolomon decoders ［C］. IEEE International Symposium on Circuits and Systems, New Orleans, LA, 2007:901904.
［11］Lee H, Azam A. Pipelined recursive modified Euclidean algorithm block for lowcomplexity, highspeed ReedSolomon decoder ［J］. Electronics Letters, 2003,39(19):13711372.
［12］Fournaris A P, Koufopavlou O. Applying systolic multiplicationinversion architectures based on modified extended Euclidean algorithm for GF(2k) in elliptic curve cryptography ［J］. Computers & Electrical Engineering, 2007,33(56):333348.

相似文献/References:

备注/Memo

备注/Memo:
收稿日期：20090925
作者简介：张天瑜(1980)，男，江苏无锡人，讲师，硕士.
研究方向：无线通信技术、通信系统仿真、信道编解码.
更新日期/Last Update: