Simplified Procedure for Decoding Nonsystematic Reed-Solomon Codes over GF(2m) Using Euclid's Algorithm and the Fast Fourier Transform

被引:6
|
作者
Lin, Tsung-Ching [1 ]
Chen, Pe-Din [1 ]
Truong, Trieu-Kien [1 ]
机构
[1] I Shou Univ, Dept Informat Sci, Dashu Township 84001, Kaohsiung Cty, Taiwan
关键词
Discrete Fourier transform; erasure; Euclidean algorithm; Fermat number; Reed-Solomon codes; transform; Welch-Berlekamp algorithm; KEY-EQUATION; STANDARD;
D O I
10.1109/TCOMM.2009.06.080080
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Gao's algorithm similar to Shiozaki's algorithm for decoding nonsystematic Reed-Solomon (RS) codes which is a subclass of the redundant residue polynomial codes is considered here. This algorithm computes the message polynomial directly without explicitly finding the error-locator polynomial and error-evaluator polynomial. In this letter, a simplified decoding algorithm to correct both errors and erasures is used in conjunction with Gao's algorithm for efficiently decoding RS codes. In addition, we show that the extended Gao algorithm similar to the Shiozaki-Truong-Cheung-Reed algorithm significantly reduces the decoding complexity.
引用
收藏
页码:1588 / 1592
页数:5
相关论文
共 24 条