Sample Entropy Calculator
Measure sequential template recurrence with nonself Chebyshev-distance matches and a fixed common template set.
YOUR CALCULATION
Result
—
Calculation steps
Work through one step at a time or reveal the complete calculation. The steps use your current inputs.
How to calculate
Use the same n−m start positions at both template lengths, count unordered distinct matching pairs and include equality at the tolerance.
SampEn=−ln(A/B); B matches at length m, A matches at length m+1
Worked example
The repeating sequence 1,2,1,2,1,2,1,2 with m=2 and tolerance 0.1 has every length-two recurrence extend, giving sample entropy zero.
Assumptions and input details
Absolute tolerance is entered directly, not automatically scaled by sample SD. No self matches. Requires matching pairs at both lengths; zero counts make the finite entropy undefined and are rejected. Descriptive sequence measure only, with no physiological or randomness diagnosis.
Using this calculator
Can I enter my own problem?
Yes. Replace the example values with your own inputs. The result, calculation steps, tables and applicable diagrams update from those inputs. Blank or invalid values clear the result; example values are never silently substituted for missing inputs.
Are the results exact?
Results use floating-point arithmetic and displayed rounding. Read the formula, assumptions and any stated data precision before interpreting the result.
Is my input uploaded?
The calculation runs in your browser. No account, file upload or external AI service is required. Inputs are not saved between page reloads.
Calculate empirical entropy, observed support and ideal coding bounds from labelled symbol counts.
Calculate a selected lag autocorrelation using the common global mean and full centered square-sum denominator.
Count above/below-cutoff runs and compute a continuity-corrected large-sample normal test approximation.
Reserved advertising space.