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

L. Yin, J. Lu, Khaled Letaief, Y. Wu

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1477-1481
Number of pages5
JournalIEEE Vehicular Technology Conference
Volume3
Issue number54ND
Publication statusPublished - 2001
Externally publishedYes

Fingerprint

Reed-Solomon codes
Reed-Solomon Codes
Burst
Decoding
Cyclic Codes
Error correction
Error Correction
Wireless Communication
Broadcast
Computational complexity
Division
Computational Complexity
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

A fast decoding algorithm for Reed-Solomon codes with enhanced burst correcting capability. / Yin, L.; Lu, J.; Letaief, Khaled; Wu, Y.

In: IEEE Vehicular Technology Conference, Vol. 3, No. 54ND, 2001, p. 1477-1481.

Research output: Contribution to journalArticle

@article{7d8864351eb544ee810fb0d802b3bc97,
title = "A fast decoding algorithm for Reed-Solomon codes with enhanced burst correcting capability",
abstract = "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.",
author = "L. Yin and J. Lu and Khaled Letaief and Y. Wu",
year = "2001",
language = "English",
volume = "3",
pages = "1477--1481",
journal = "IEEE Vehicular Technology Conference",
issn = "0740-0551",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "54ND",

}

TY - JOUR

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

AU - Yin, L.

AU - Lu, J.

AU - Letaief, Khaled

AU - Wu, Y.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0035178240&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035178240&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035178240

VL - 3

SP - 1477

EP - 1481

JO - IEEE Vehicular Technology Conference

JF - IEEE Vehicular Technology Conference

SN - 0740-0551

IS - 54ND

ER -