一种RS码的快速译码方法  

A Method for Fast Decoding RS Codes

作　　者：鞠苏明[1] 毕光国[1] 

机构地区：[1]东南大学无线电工程系,南京210096

出　　处：《通信学报》1999年第S1期274-278,共5页Journal on Communications

摘　　要：本文利用伴随矩阵的奇异性来找出RS码的错误位置。每找出一个错误位置,对伴随式进行一次迭代运算并使伴随矩阵降一阶。利用迭代运算所得的伴随式.可容易地计算出错误值。该译码算法速度快,硬件实现不复杂。This paper uses the singularity of the syndrome matrix to find out the error locations of RS codes. After every error location has been found out .we calculate the syndrome values by an it eration method and reduce the orders of the syndrome matrix by one. With the syndrome values of iteration,the error values are easily evaluated. This decoding algorithm executes fast,its hardware implementation is not complex.

关 键 词：RS码 译码算法 迭代运算 伴随矩阵 

分 类 号：TN911.22[电子电信—通信与信息系统]