A fast decoding algorithm for Reed-Solomon codes with enhanced burst correcting capability

Based on the properties of cyclic codes, a new decoding algorithm for burst-error-correction is proposed in this paper. This algorithm can effectively correct burst errors with length that approaches to n-k for (n,k) Reed-Solomon (RS) codes. Moreover, due to the use of error locations correlation wi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211) Vol. 3; pp. 1477 - 1481 vol.3
Main Authors: Liuguo Yin, Jianhua Lu, Letaief, K.B., Youshou Wu
Format: Conference Proceeding
Language:English
Published: IEEE 2001
Subjects:
Computational complexity
Decoding
Delay
Error correction
Error correction codes
Galois fields
Reed-Solomon codes
Water
Wireless communication
ISBN:9780780370050, 0780370058
ISSN:1090-3038
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Based on the properties of cyclic codes, a new decoding algorithm for burst-error-correction is proposed in this paper. This algorithm can effectively correct burst errors with length that approaches to n-k for (n,k) Reed-Solomon (RS) codes. Moreover, due to the use of error locations correlation within a burst, divisions are exempted from the decoding process, achieving a fast decoding algorithm with much less computational complexity compared with existing algorithms. It is shown that the proposed algorithm can be widely used in wireless communications, wireless digital broadcast systems, and so on.
ISBN:9780780370050
0780370058
ISSN:1090-3038
DOI:10.1109/VTC.2001.956443