On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes

We consider an iterative decoding algorithm by using algebraic decoding for non-binary codes. In the decoding algorithm, algebraic decoding are carried out with respect to successively chosen input words, called the search centers. We present a new method for selecting sequences of search centers of algebraic decoding. Over the AWGN channel using BPSK signaling, we show simulation results on the error performances of the iterative decoding algorithms whose search centers are given by the proposed method, abbreviated IAD, for Reed-Solomon codes. From the simulation results, IAD provides considerably better error performance than GMD and CGA decoding with the same number of iterations.