An improvement to GMD-like decoding algorithms
For binary linear block codes, we introduce "multiple GMD decoding algorithm." In this algorithm, GMD-like decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.
multiple gmd decoding soft-decision iterative decoding early termination conditions binary block codes