Digital Commons Network^™

A Super Fast Algorithm For Estimating Sample Entropy, Weifeng Liu, Ying Jiang, Yuesheng Xu

Mathematics & Statistics Faculty Publications

: Sample entropy, an approximation of the Kolmogorov entropy, was proposed to characterize complexity of a time series, which is essentially defined as − log(B/A), where B denotes the number of matched template pairs with length m and A denotes the number of matched template pairs with m + 1, for a predetermined positive integer m. It has been widely used to analyze physiological signals. As computing sample entropy is time consuming, the box-assisted, bucket-assisted, x-sort, assisted sliding box, and kd-tree-based algorithms were proposed to accelerate its computation. These algorithms require O(N²) or …