An architectural comparison of reed-solomon soft-decoding algorithms

Arshad Ahmed; Naresh R Shanbhag; Ralf Koetter

doi:10.1109/ACSSC.2006.354883

An architectural comparison of reed-solomon soft-decoding algorithms

Arshad Ahmed, Naresh R Shanbhag, Ralf Koetter

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	Conference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06
Pages	912-916
Number of pages	5
DOIs	https://doi.org/10.1109/ACSSC.2006.354883
State	Published - 2006
Event	40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06 - Pacific Grove, CA, United States Duration: Oct 29 2006 → Nov 1 2006

Other

Other	40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06
Country/Territory	United States
City	Pacific Grove, CA
Period	10/29/06 → 11/1/06

ASJC Scopus subject areas

Engineering(all)

Online availability

10.1109/ACSSC.2006.354883

Library availability

Discover UIUC Full Text

Cite this

Ahmed, A, Shanbhag, NR & Koetter, R 2006, An architectural comparison of reed-solomon soft-decoding algorithms. in Conference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06., 4176693, pp. 912-916, 40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06, Pacific Grove, CA, United States, 10/29/06. https://doi.org/10.1109/ACSSC.2006.354883

@inproceedings{f262d6b56f184716b0e68eb509218f68,

title = "An architectural comparison of reed-solomon soft-decoding algorithms",

abstract = "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.",

author = "Arshad Ahmed and Shanbhag, {Naresh R} and Ralf Koetter",

year = "2006",

doi = "10.1109/ACSSC.2006.354883",

language = "English (US)",

isbn = "1424407850",

pages = "912--916",

booktitle = "Conference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06",

note = "40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06 ; Conference date: 29-10-2006 Through 01-11-2006",

}

TY - GEN

T1 - An architectural comparison of reed-solomon soft-decoding algorithms

AU - Ahmed, Arshad

AU - Shanbhag, Naresh R

AU - Koetter, Ralf

PY - 2006

Y1 - 2006

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

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

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

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

U2 - 10.1109/ACSSC.2006.354883

DO - 10.1109/ACSSC.2006.354883

M3 - Conference contribution

AN - SCOPUS:47049108443

SN - 1424407850

SN - 9781424407859

SP - 912

EP - 916

BT - Conference Record of the 40th Asilomar Conference on Signals, Systems and Computers, ACSSC '06

T2 - 40th Asilomar Conference on Signals, Systems, and Computers, ACSSC '06

Y2 - 29 October 2006 through 1 November 2006

ER -

An architectural comparison of reed-solomon soft-decoding algorithms

Abstract

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this