The aim of this study is to show that the measures derived from Electrocardiogram (ECG) signals many a time perform better than the same measures obtained from heart rate (HR) signals. A comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ECG signals and HR signals, and thereby discriminate between normal and cong...

the aim of this study is to show that the measures derived from electrocardiogram (ecg) signals many a time perform better than the same measures obtained from heart rate (hr) signals. a comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ecg signals and hr signals, and thereby discriminate between normal and cong...

We address this work to investigate symbolic sequences with long-range correlations by using computational simulation. We analyze sequences with two, three and four symbols that could be repeated l times, with the probability distribution p(l) ∝ 1/lμ. For these sequences, we verified that the usual entropy increases more slowly when the symbols are correlated and the Tsallis entropy exhibits, f...

The aim of this study is to show that the measures derived from Electrocardiogram (ECG) signals many a time perform better than the same measures obtained from heart rate (HR) signals. A comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ECG signals and HR signals, and thereby discriminate between normal and cong...

Data-analytic interpretations for the canonical projections (or decomposition) theorem for finite groups are illustrated in the study of data indexed by dihedral permutations of three and four symbols. The purpose of this paper is to apply and develop the methodology of symmetry studies to the analysis of data indexed by those permutations, both descriptively and for statistical inference under...

This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon-McMillan-Breiman theorem suggest several relations between the statistical features of ‘symbolic’ recurrence plots and the entropy per unit time of the dynamics; their practical efficiency for experimental sequences of finite length is checked numerically on two paradigmatic mod...

Signals that represent information may be classified into two forms: numeric and symbolic. Symbolic signals are discrete-time sequences that at, any particular index, have a value that is a member of a finite set of symbols. Set membership defines the only mathematical structure that symbolic sequences satisfy. Consequently, symbolic signals cannot be directly processed with existing signal pro...

We developed a non-parametric method of Information Decomposition (ID) of a content of any symbolical sequence. The method is based on the calculation of Shannon mutual information between analyzed and artificial symbolical sequences, and allows the revealing of latent periodicity in any symbolical sequence. We show the stability of the ID method in the case of a large number of random letter c...

A practical measure for the complexity of sequences of symbols (“strings”) is introduced that is rooted in automata theory but avoids the problems of Kolmogorov–Chaitin complexity. This physical complexity can be estimated for ensembles of sequences, for which it reverts to the difference between the maximal entropy of the ensemble and the actual entropy given the specific environment within wh...