Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel

Liuguo Yin, Jianhua Lu, Khaled Letaief, Youshou Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Various communication and storage systems are likely corrupted by bursts of noise. These bursts may be long in duration, resulting in a significant degradation for the system performance. Reed-Solomon (RS) codes are proven to be very effective in correcting burst errors. According to the Singleton bound, the maximum length of burst errors that can be corrected by an (n, k) RS code is (n-k)/2 symbols. However, it turns out that, if correlation between erroneous symbols within bursts is considered and well used, the variables for burst locations will be decreased and, accordingly, decoding capability may be enhanced with increased length of correctable bursts. As such, we propose a new burst-error-correcting algorithm. It is shown that, for (n, k) RS codes, this algorithm can correct continuous burst errors with length that approaches to n-k symbols with fairly low miscorrection probability, achieving a good performance over long-burst channels.

Original languageEnglish
Title of host publication2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages77-81
Number of pages5
ISBN (Electronic)0780375475, 9780780375475
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event1st International Conference on Communications, Circuits and Systems, ICCCAS 2002 - Chengdu, China
Duration: 29 Jun 20021 Jul 2002

Other

Other1st International Conference on Communications, Circuits and Systems, ICCCAS 2002
CountryChina
CityChengdu
Period29/6/021/7/02

Fingerprint

Reed-Solomon codes
Decoding
Degradation
Communication

Keywords

  • burst errors
  • burst-error-correcting capability
  • decoding algorithms
  • Reed-Solomon code

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Yin, L., Lu, J., Letaief, K., & Wu, Y. (2002). Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel. In 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings (pp. 77-81). [1180576] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCAS.2002.1180576

Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel. / Yin, Liuguo; Lu, Jianhua; Letaief, Khaled; Wu, Youshou.

2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2002. p. 77-81 1180576.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yin, L, Lu, J, Letaief, K & Wu, Y 2002, Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel. in 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings., 1180576, Institute of Electrical and Electronics Engineers Inc., pp. 77-81, 1st International Conference on Communications, Circuits and Systems, ICCCAS 2002, Chengdu, China, 29/6/02. https://doi.org/10.1109/ICCCAS.2002.1180576
Yin L, Lu J, Letaief K, Wu Y. Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel. In 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2002. p. 77-81. 1180576 https://doi.org/10.1109/ICCCAS.2002.1180576
Yin, Liuguo ; Lu, Jianhua ; Letaief, Khaled ; Wu, Youshou. / Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel. 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2002. pp. 77-81
@inproceedings{5a37312c16b54667813752d6780483e0,
title = "Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel",
abstract = "Various communication and storage systems are likely corrupted by bursts of noise. These bursts may be long in duration, resulting in a significant degradation for the system performance. Reed-Solomon (RS) codes are proven to be very effective in correcting burst errors. According to the Singleton bound, the maximum length of burst errors that can be corrected by an (n, k) RS code is (n-k)/2 symbols. However, it turns out that, if correlation between erroneous symbols within bursts is considered and well used, the variables for burst locations will be decreased and, accordingly, decoding capability may be enhanced with increased length of correctable bursts. As such, we propose a new burst-error-correcting algorithm. It is shown that, for (n, k) RS codes, this algorithm can correct continuous burst errors with length that approaches to n-k symbols with fairly low miscorrection probability, achieving a good performance over long-burst channels.",
keywords = "burst errors, burst-error-correcting capability, decoding algorithms, Reed-Solomon code",
author = "Liuguo Yin and Jianhua Lu and Khaled Letaief and Youshou Wu",
year = "2002",
doi = "10.1109/ICCCAS.2002.1180576",
language = "English",
pages = "77--81",
booktitle = "2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel

AU - Yin, Liuguo

AU - Lu, Jianhua

AU - Letaief, Khaled

AU - Wu, Youshou

PY - 2002

Y1 - 2002

N2 - Various communication and storage systems are likely corrupted by bursts of noise. These bursts may be long in duration, resulting in a significant degradation for the system performance. Reed-Solomon (RS) codes are proven to be very effective in correcting burst errors. According to the Singleton bound, the maximum length of burst errors that can be corrected by an (n, k) RS code is (n-k)/2 symbols. However, it turns out that, if correlation between erroneous symbols within bursts is considered and well used, the variables for burst locations will be decreased and, accordingly, decoding capability may be enhanced with increased length of correctable bursts. As such, we propose a new burst-error-correcting algorithm. It is shown that, for (n, k) RS codes, this algorithm can correct continuous burst errors with length that approaches to n-k symbols with fairly low miscorrection probability, achieving a good performance over long-burst channels.

AB - Various communication and storage systems are likely corrupted by bursts of noise. These bursts may be long in duration, resulting in a significant degradation for the system performance. Reed-Solomon (RS) codes are proven to be very effective in correcting burst errors. According to the Singleton bound, the maximum length of burst errors that can be corrected by an (n, k) RS code is (n-k)/2 symbols. However, it turns out that, if correlation between erroneous symbols within bursts is considered and well used, the variables for burst locations will be decreased and, accordingly, decoding capability may be enhanced with increased length of correctable bursts. As such, we propose a new burst-error-correcting algorithm. It is shown that, for (n, k) RS codes, this algorithm can correct continuous burst errors with length that approaches to n-k symbols with fairly low miscorrection probability, achieving a good performance over long-burst channels.

KW - burst errors

KW - burst-error-correcting capability

KW - decoding algorithms

KW - Reed-Solomon code

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

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

U2 - 10.1109/ICCCAS.2002.1180576

DO - 10.1109/ICCCAS.2002.1180576

M3 - Conference contribution

AN - SCOPUS:58149475785

SP - 77

EP - 81

BT - 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -