Adaptive Erasure decoder for Reed-Solomon code and its performance in Rayleigh fading channel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

A new reduced complexity decoding algorithm, called Adaptive Successive Erasure Correction (ASEC), is considered. It is applied to non-binary Reed Solomon code coupled with general MPSK modulation. The performance of the corresponding system is analyzed under assumption that the transmitted signals suffer from Additive White Gaussian Noise (AWGN) and slow flat Rayleigh fading. The examined algorithm is compared with the General Minimum Distance (GMD) and with the Successive Erasure Minimum Distance (SEMD) decoding algorithms. It has reduced complexity while the loss of performance does not exceed 1 dB in SNR. The relative advantage of the proposed algorithm becomes more significant with increasing of the code symbol size.

Original languageEnglish
Title of host publication2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Pages157-161
Number of pages5
DOIs
StatePublished - 1 Dec 2008
Event2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008 - Eilat, Israel
Duration: 3 Dec 20085 Dec 2008

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Country/TerritoryIsrael
CityEilat
Period3/12/085/12/08

Keywords

  • Adaptive decoding
  • Error correction coding
  • Fading channel
  • Reed-Solomon code

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Adaptive Erasure decoder for Reed-Solomon code and its performance in Rayleigh fading channel'. Together they form a unique fingerprint.

Cite this