Selection of search centers in iterative soft-decision decoding algorithms
We consider iterative soft-decision decoding algorithms in which bounded distance decodings are carried out with respect to successively selected input words, called search centers. Their error performances are degraded by the decoding failure of bounded distance decoding and the duplication in generating candidate codewords. To avoid those weak points, we present a new method of selecting sequences of search centers. For some BCH codes, we show the effectiveness by simulation results.
soft-decision decoding bch code iterative decoding bounded-distance decoding