Analysis of decoding complexity using the Berry-Esseen theorem

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

doi:10.1109/ISIT.2002.1023558

Analysis of decoding complexity using the Berry-Esseen theorem

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

電機工程學系

研究成果: Article › 同行評審

摘要

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.

原文	English
文章編號	1023558
頁（從 - 到）	286-286
頁數	1
期刊	IEEE International Symposium on Information Theory-Proceedings
DOIs	https://doi.org/10.1109/ISIT.2002.1023558
出版狀態	Published - 30 6月 2002

存取文件

10.1109/ISIT.2002.1023558

其它文件與鏈接

Link to publication in Scopus

引用此

@article{f57d9f887b524a66b730d4607e65116e,

title = "Analysis of decoding complexity using the Berry-Esseen theorem",

abstract = "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.",

author = "Po-Ning Chen and Han, {Yunghsiang S.} and Hartmann, {Carlos R P} and Wu, {Hong Bin}",

year = "2002",

month = jun,

day = "30",

doi = "10.1109/ISIT.2002.1023558",

language = "English",

pages = "286--286",

journal = "IEEE International Symposium on Information Theory-Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Analysis of decoding complexity using the Berry-Esseen theorem

AU - Chen, Po-Ning

AU - Han, Yunghsiang S.

AU - Hartmann, Carlos R P

AU - Wu, Hong Bin

PY - 2002/6/30

Y1 - 2002/6/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036352131&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2002.1023558

DO - 10.1109/ISIT.2002.1023558

M3 - Article

AN - SCOPUS:0036352131

SN - 2157-8095

SP - 286

EP - 286

JO - IEEE International Symposium on Information Theory-Proceedings

JF - IEEE International Symposium on Information Theory-Proceedings

M1 - 1023558

ER -

Analysis of decoding complexity using the Berry-Esseen theorem

摘要

存取文件

其它文件與鏈接

指紋

引用此