Analysis of decoding complexity using the Berry-Esseen theorem

Po-Ning Chen, Yunghsiang S. Han, Carlos R P Hartmann, Hong Bin Wu

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number1023558
Pages (from-to)286-286
Number of pages1
JournalIEEE International Symposium on Information Theory-Proceedings
StatePublished - 30 Jun 2002


Dive into the research topics of 'Analysis of decoding complexity using the Berry-Esseen theorem'. Together they form a unique fingerprint.

Cite this