Title :
A new treatment of priority-first search maximum-likelihood soft-decision decoding for linear block codes
Author :
Han, Yunghsiang S.
Author_Institution :
Dept. of Electron. Eng., Hua Fan Coll. of Humanities & Technol., Taipei, Taiwan
fDate :
29 Jun-4 Jul 1997
Abstract :
We present a new method to convert the maximum-likelihood soft-decision decoding problem for linear block codes into a graph search problem where the generalized Dijkstra´s algorithm (GDA) still can apply on the decoding procedure. The new decoding algorithm uses the properties of error patterns to reduce the search space
Keywords :
block codes; graph theory; linear codes; maximum likelihood decoding; search problems; GDA; error patterns; generalized Dijkstra´s algorithm; graph search problem; linear block codes; priority-first search maximum-likelihood soft-decision decoding; search space; Block codes; Cost function; Educational institutions; Electronic mail; Maximum likelihood decoding; Maximum likelihood estimation; Search problems; Tree graphs; Upper bound; Vectors;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613331
