Browsing by Author "Han, YS"

Now showing 1 - 2 of 2

Analysis of decoding complexity using the Berry-Esseen theorem
(2002)
Chen, PN
;
Han, YS
;
Hartmann, CRP
;
Wu, HB
;
電信工程研究所
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.
Distance-spectrum formulas on the largest minimum distance of block codes
(2000-05-01)
Chen, PN
;
Lee, TY
;
Han, YS
;
電信工程研究所
;
Institute of Communications Engineering
A general formula for the asymptotic largest minimum distance (in block length) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric, and bounded) is presented. As revealed in the formula, the largest minimum distance can be fully determined by the ultimate statistical characteristics of the normalized distance function evaluated under a properly chosen random-code generating distribution. Interestingly, the new formula has an analogous form to the general information-spectrum expressions of the channel capacity and the optimistic channel capacity, respectively derived by Verdu-Han [29] and Chen-Alajaji [7], [8], As a result, a minor class of distance functions for which the largest minimum distance can be derived is characterized. A general Varshamov-Gilbert lower bound is next addressed. Some discussions on the tightness of the general Varshamov-Gilbert bound are also provided. Finally, lower bounds on the largest minimum distances for several specific block coding schemes are rederived in terms of the new formulas, followed by comparisons with the known results devoted to the same codes.