A technique to analyze the computational efforts of an ordering free variant of the generalized Dijkstras's algorithm (GDA) and the maximum-likelihood sequential decoding algorithm (MLSDA) was presented based on the Berry-Esseen theorem. The complexities of two sequential maximum likelihood decoding algorithms were analyzed. The results were given by proving various theorems.
|頁（從 - 到）||286-286|
|期刊||IEEE International Symposium on Information Theory-Proceedings|
|出版狀態||Published - 30 6月 2002|