Gröbner basis with queue approach to solve Welch-Berlekamp equation

Maidee, Pongstorn; Choomchuay, Somsak

Gröbner basis with queue approach to solve Welch-Berlekamp equation

Author(s)

Maidee, Pongstorn

Choomchuay, Somsak

Date Issued

December 1, 1997

Type

Conference Paper

Abstract

The better way to decode RS code, there is not only the hard-decision technique but also soft-decision decoding. Given by Welch-Berlekamp algorithm; the soft-decision gives one-run generalised minimum distance decoding. The additional feature that can further avoid unnecessary computation is elaborated in this paper. The new approach is easier to understand. We show that if we found the satisfied position set to the Welch-Berlekamp equation at each stage, we need to compute only one element of its set, all the left can automatically go to the next stage. At the stage that has no position left unless in the defined set, we need not to work further. This yields better computation performance. The hardware requirement applied to the RS code with moderate average error correctivity can be designed accordingly.

Citation

International Symposium on IC Technology Systems and Applications, 7, 573-575, 1997