1. bookVolume 17 (2020): Issue 2 (December 2020)
Journal Details
License
Format
Journal
eISSN
2668-4217
First Published
30 Jul 2019
Publication timeframe
2 times per year
Languages
English
access type Open Access

Methods in Complexity Analysis of Discrete Time Signals

Published Online: 12 Dec 2020
Volume & Issue: Volume 17 (2020) - Issue 2 (December 2020)
Page range: 54 - 56
Journal Details
License
Format
Journal
eISSN
2668-4217
First Published
30 Jul 2019
Publication timeframe
2 times per year
Languages
English
Abstract

Discrete time signals carry information about systems and their internal functional mechanisms which characterize their complexity. Complexity measures are strongly related to information content and evaluations have been made on various signals in many ways in last few years. This paper uses information theory estimates of complexity as different types of entropies in order to estimate the complexity of various time discrete synthesized signals. Results show that this kind of indices can be a useful tool in diagnostic, fault detection and further development.

Keywords

[1] Shannon, C. E., A mathematical theory of communication, Bell Syst. Tech. J. Nr. 27 (1948) pp. 379-423., 623-656.Search in Google Scholar

[2] Fefferman, R., A. A theory of entropy in Fourier analysis. Advances in Mathematics Volume 30, Issue 3, December 1978, Pages 171-20110.1016/0001-8708(78)90036-1Search in Google Scholar

[3] Jiang, Y., Mao, D. and Xu., Y., A fast algorithm for computing sample entropy, Advances in Adaptive Data Analysis, Vol. 03, No. 01, (2011), pp. 167-186.Search in Google Scholar

[4] Pincus, S. M., Approximate entropy as a measure of system complexity. Proceeding of National Academy of Sciences USA, Mathematics, Vol. 88 (1991), pp. 2297-2301.Search in Google Scholar

[5] Lake, D. E., Richman, J. S, Griffin, M. P., Moorman, J. R. Sample entropy analysis of neonatal heart rate variability. Am J Physiol 2002; 283(3):R789-R79710.1152/ajpregu.00069.200212185014Search in Google Scholar

[6] Bandt, C.; Pompe, B. Permutation entropy: A natural complexity measure for time series. Phys. Rev. Lett. 2002, 88, 174102:1-174102:410.1103/PhysRevLett.88.17410212005759Search in Google Scholar

[7] Molina-Picó, A., Cuesta-Frau,D., Aboy, M., Crespo, C., Miró-Marttinez, P., Oltra-Crespo, S. Comparative study of approximate entropy and sample entropy robustness to spikes, Artificial Intelligence inMedicine, vol. 53, no. 2, 2011, pp. 97-106.10.1016/j.artmed.2011.06.00721835600Search in Google Scholar

[8] Lempel, A., Ziv, J., On the complexity of finite sequences, IEEE Transactions on Information Theory, vol. IT-22, no. 1, 1976, pp. 75-81.10.1109/TIT.1976.1055501Search in Google Scholar

[9] Y. Bar-Yam, Dynamics of complex systems, vol. 213. Addison-Wesley Reading, MA, 1997.Search in Google Scholar

[10] Ziv, J., Merhav, J., Z., A measure of relative entropy between in-dividual sequences with application to universal classification, IEEETransaction on Information Theory, vol. 39, no. 4, pp. 1270–1279, Jul. 1993.Search in Google Scholar

Recommended articles from Trend MD

Plan your remote conference with Sciendo