An Efficient Heuristic Search Method for Maximum Likelihood Decoding of Linear Block Codes Using Dual Codes

摘要

Y. S. Han et al. Have proposed an efficient max- imum likelihooddecoding (MLD) algorithm using A~* algorithm which is the graphsearch method. In this paper, we propose a new MLD algorithm forlinear block codes. The MLD algo- rithm proposed in this paperimproves that given by Han et al. utilizing codewords of dual codes.This scheme reduces the num- Ber of generated codewords in the MLDalgorithm. We show That the complexity of the proposed decodingalgorithm is re- Duced compared to that given by Han et al. Withoutincreasing The probability of decoding error.