An architectural comparison of reed-solomon soft-decoding algorithms

Arshad Ahmed, Naresh R Shanbhag, Ralf Koetter

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


Reed-Solomon codes are used as error-correcting codes in diverse communication system applications. The decoding performance of traditional hard-decision Reed-Solomon decoders can be improved via the use of sonft-decoding algorithms such as generalized minimum distance decoding, algebraic sonft-decision decoding, and ordered statistics decoding. While it is relatively straight-forward to compare the decoding performance of these algorithms, it is harder to compare their hardware complexity. This is because an efficient architecture has a dramatic effect on the final implementation complexity. In this paper, we present efficient hardware architectures for each of the sonft-decoding algorithms and compare their implementation complexity.

Original languageEnglish (US)
Title of host publicationConference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
Number of pages5
StatePublished - 2006
Event40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06 - Pacific Grove, CA, United States
Duration: Oct 29 2006Nov 1 2006


Other40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
Country/TerritoryUnited States
CityPacific Grove, CA

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'An architectural comparison of reed-solomon soft-decoding algorithms'. Together they form a unique fingerprint.

Cite this