Fast chase algorithms for decoding Reed-Solomon codes

Author

Shao-I Chu ; Yan-Haw Chen ; Yi-Chan Chiu ; Ru-Sian Chang

Author_Institution

Dept. of Electron. Eng., Nat. Kaohsiung of Appl. Sci., Kaohsiung, Taiwan

fYear

2014

fDate

7-10 May 2014

Firstpage

1

Lastpage

3

Abstract

This paper presented the modified Chase algorithms to improve the decoding time by reducing the number of candidate codewords. Generally speaking, the candidate codewords will increase with the error correction capability of the code. This fact leads to decoding complexity. The innovations of the proposed algorithm lie in the two-step reliability information selection. Simulation results showed the decoding time of the new scheme is significantly improved, while the error correction performance is almost the same as compared with the conventional Chase-2 algorithm.

Keywords

Reed-Solomon codes; computational complexity; decoding; error correction; telecommunication network reliability; Reed-Solomon code decoding; candidate codeword number reduction; decoding complexity; decoding time improvement; error correction capability; fast chase algorithms; soft-decision decoding; two-step reliability information selection; AWGN channels; Algorithm design and analysis; Binary phase shift keying; Maximum likelihood decoding; Reed-Solomon codes; Reliability; Chase algorithm; Keyworkds; Reed-Solomon code; reliability; soft-decision decoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Next-Generation Electronics (ISNE), 2014 International Symposium on

Conference_Location

Kwei-Shan

Type

conf

DOI

10.1109/ISNE.2014.6839376

Filename

6839376