MODIFIED MINIMUM-WEIGHT DECODING FOR REED-SOLOMON CODES

被引:4
作者
MARTIN, I [1 ]
HONARY, B [1 ]
FARRELL, PG [1 ]
机构
[1] UNIV MANCHESTER,SCH ENGN,COMMUN RES GRP,MANCHESTER,LANCS,ENGLAND
关键词
DECODING; REED-SOLOMON CODES;
D O I
10.1049/el:19950495
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The authors describe an improvement to the minimum-weight decoding (MWD) algorithm for Reed-Solomon (RS) codes. The modification improves the probability of the MWD algorithm 'trapping' the error pattern by squaring each of the terms in the received codeword resulting in a transformation which changes the order of the symbols while maintaining the cyclic properties of the codeword. The results of computer simulations are presented which show that the modified decoder provides an improvement in error performance of similar to 1 dB over the conventional technique with no increase in decoder complexity. The results show that the modified technique achieves an error performance close to that of maximum-likelihood algorithms with similar to 1/6 the complexity.
引用
收藏
页码:713 / 714
页数:2
相关论文
共 8 条
[1]  
CLAR GC, 1981, ERROR CORRECTION COD
[2]  
CLARK PDJ, 1994, 6TH P ITN C HF RAD S, P330
[3]  
FARRELL PG, 1989, CRYPTOGRAPHY CODING
[4]  
Macwilliams F. J., 1977, THEORY ERROR CORRECT
[5]  
MacWilliams F. J., 1964, BELL SYST TECH J, V43, P485
[6]  
MICHELSON AM, 1985, ERROR CONTROL TECHNO
[7]   POLYNOMIAL CODES OVER CERTAIN FINITE FIELDS [J].
REED, IS ;
SOLOMON, G .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (02) :300-304
[8]  
Sklar B., 1988, DIGITAL COMMUNICATIO