Cargando…
A Super Fast Algorithm for Estimating Sample Entropy
Sample entropy, an approximation of the Kolmogorov entropy, was proposed to characterize complexity of a time series, which is essentially defined as [Formula: see text] , where B denotes the number of matched template pairs with length m and A denotes the number of matched template pairs with [Form...
Autores principales: | Liu, Weifeng, Jiang, Ying, Xu, Yuesheng |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9027109/ https://www.ncbi.nlm.nih.gov/pubmed/35455187 http://dx.doi.org/10.3390/e24040524 |
Ejemplares similares
-
Application of Positional Entropy to Fast Shannon Entropy Estimation for Samples of Digital Signals
por: Cholewa, Marcin, et al.
Publicado: (2020) -
Evaluation of Fast Sample Entropy Algorithms on FPGAs: From Performance to Energy Efficiency
por: Chen, Chao, et al.
Publicado: (2022) -
Room-temperature super-elongation in high-entropy alloy nanopillars
por: Zhang, Qian, et al.
Publicado: (2023) -
Fast reconstruction algorithm based on HMC sampling
por: Lian, Hang, et al.
Publicado: (2023) -
Estimating Position from Millisecond Samples of GPS Signals (the “FastFix” Algorithm)
por: Molteno, Timothy C. A.
Publicado: (2020)