A Chase-like Decoding Algorithm for Reed–Solomon Codes Based on the Extended Euclidean Algorithm

Conference: SCC 2015 - 10th International ITG Conference on Systems, Communications and Coding
02/02/2015 - 02/05/2015 at Hamburg, Germany

Proceedings: ITG-Fb 254: 10th International ITG Conference on Systems, Communications and Coding (SCC 2015)

Pages: 4Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Authors:
Mohamed, Mostafa H.; Bossert, Martin (Institute of Communications Engineering, Ulm University, Ulm, Germany)

Abstract:
A novel method to obtain a basis for all possible solutions for decoding Reed–Solomon (RS) codes is given, using an intermediate result of decoding obtained by the Extended Euclidean Algorithm. The unknowns of the possible solutions can be calculated if reliability information is available. Numerical results show that this approach has a superior performance compared to Generalized Minimum Distance decoding [1]. Further, the new method has for a relatively high-rate RS code a lower complexity and a lower error rate when compared to the Kötter–Vardy algorithm [2].