| Reed—Solomon码的快速译码 |
| |
| 引用本文： | 陈大镒.Reed—Solomon码的快速译码[J].大连理工大学学报,1991,31(6):705-710. |
| |
| 作者姓名： | 陈大镒 |
| |
| 作者单位： | 大连理工大学电子工程系 |
| |
| 摘 要： | 研究了 Ｒｅｅｄ－Ｓｏｌｏｍｏｎ码的快速译码问题。译码中，利用了有限域ＧＦ（Ｆｎ）上的 ＦＦＴ变换，并采用了本文提出的改进的 Ｂｅｒｌｅｋａｍｐ－Ｍａｓｓｅｙ算法求差错定位多项式．从而减少了迭代次数，提高了译码速度。此法为使用较长 Ｒｅｅｄ－Ｓｏｌｏｍｏｎ码提供可能性，使之具有更强的纠错能力。文中还给出了计算机模拟计算结果。
|
| 关 键 词： | R－S码 译码 有限域 纠错码 |
Fast decoding of Reed- Solomon codes |
| |
| Chen Dayi.Fast decoding of Reed- Solomon codes[J].Journal of Dalian University of Technology,1991,31(6):705-710. |
| |
| Authors: | Chen Dayi |
| |
| Abstract: | The problem of the fast decoding of Reed-Solomon codes (RS) has been studied in this paper. In the process of fast decoding,on the basis of the FFT trantsform over Galois field CF(Fn), RS codes can -be decoded effectively and the iterative times can be decreased by means of the improved Berlekamp- Massey algorithm to evaluate error locator polynomial, which is proposed in this paper. It enables us to use longer RS codes, whose error-correcting the capability is more powerful.The imitative results calculated by computer have also been given in this paper. |
| |
| Keywords: | finite field error correcting code/error locator polynomial |
| 本文献已被 CNKI 维普 等数据库收录！ |
