標題: Analysis of decoding complexity using the Berry-Esseen theorem
作者: Chen, PN
Han, YS
Hartmann, CRP
Wu, HB
電信工程研究所
Institute of Communications Engineering
公開日期: 2002
摘要: This work presents a novel 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) based on the Berry-Esseen theorem. Different from the theoretical bounds determined by the conventional central limit theorem argument, which often holds only for sufficiently large blocklength, the new bounds are valid for any blocklength.
URI: http://hdl.handle.net/11536/18775
ISBN: 0-7803-7501-7
期刊: ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS
起始頁: 286
結束頁: 286
顯示於類別:會議論文