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
相关论文
共 50 条
  • [1] DECODING OF REED-SOLOMON CODES
    MANDELBAUM, D
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (06) : 707 - +
  • [2] Modified Euclidean Algorithms for Decoding Reed-Solomon Codes
    Sarwate, Dilip V.
    Yan, Zhiyuan
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1398 - +
  • [3] Decoding Reed-Solomon codes beyond half the minimum distance
    Nielsen, RR
    Hoholdt, T
    CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2000, : 221 - 236
  • [4] A modified blahut algorithm for decoding reed-solomon codes beyond half the minimum distance
    Egorov, S
    Markarian, G
    SYMPOTIC'03: JOINT IST WORKSHOP ON MOBILE FUTURE & SYMPOSIUM ON TRENDS IN COMMUNICATIONS, PROCEEDINGS, 2003, : 17 - 20
  • [5] A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
    Egorov, S
    Markarian, G
    Pickavance, K
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (12) : 2052 - 2056
  • [6] Sequential Decoding of Reed-Solomon Codes
    Miloslavskaya, Vera
    Trifonov, Peter
    2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 453 - 457
  • [7] Parallel decoding of the Reed-Solomon codes
    Sukhov, EG
    AUTOMATION AND REMOTE CONTROL, 2001, 62 (12) : 2037 - 2041
  • [8] THE DECODING OF EXTENDED REED-SOLOMON CODES
    DUR, A
    DISCRETE MATHEMATICS, 1991, 90 (01) : 21 - 40
  • [9] COMPLEXITY OF DECODING REED-SOLOMON CODES
    JUSTESEN, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (02) : 237 - 238
  • [10] On Fractional Decoding of Reed-Solomon Codes
    Santos, Welington
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1552 - 1556