Examples
Examples
Try the starting example
- Reference samples
- 0,1,2,1,0
- Delayed samples
- 0,0,1,2,1
- Maximum absolute lag
- 2
- Lag and raw correlation pairs
- [[-2,0],[-1,1],[0,4],[1,6],[2,4]]
- Best candidate delay (samples)
- 1
Try another scenario
- Reference samples
- [0, 1, 2, 1, 0]
- Delayed samples
- [1, 2, 1, 0, 0]
- Maximum absolute lag
- 2
- Lag and raw correlation pairs
- [[-2,4],[-1,6],[0,4],[1,1],[2,0]]
- Best candidate delay (samples)
- -1
Calculation method
Calculation method
Lag and raw correlation pairs
At lag L sum reference[n]×delayed[n+L] over overlap.
Best candidate delay (samples)
First ascending lag with greatest correlation; not a causal proof.
Symbols and units
- a
- Reference samples
- b
- Delayed samples
- c
- Maximum absolute lag
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Two sample sequences, lag limits. Returns Correlation and candidate delay. All coefficients and observations are user supplied; results describe only the stated mathematical model. Quantities are deterministic calculations from supplied observations and assumptions; no external data is fetched. Supported limits: Finite inputs only; numeric fields bounded as labelled. Lists and JSON records are limited to 256 entries unless a stricter tool bound is stated. No automatic design approval, legal conclusion, treatment recommendation or safety certification. Reference samples: minimum None, maximum 1000000000000.0. Delayed samples: minimum None, maximum 1000000000000.0. Maximum absolute lag: minimum 0, maximum 255.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
Background reading; this does not imply endorsement or independent review of SumFizz.