circular_autocorrelation

std.seq.circular_autocorrelation · Level L4

The circular autocorrelation of a real signal, rₖ = Σⱼ xⱼ·x₍ⱼ₊ₖ₎ mod n, by the Wiener–Khinchin theorem: the inverse transform of the power spectrum.

r = ifft(|fft(x)|²)

Signature

circular_autocorrelation(x: f64[n]) → f64[n]

Structure

The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.

xf64[n]Reshapez_re0.0Multiplyz_imConcatzFFTXSlicep_rSlicep_iMultiplyp_rrMultiplyp_iiAddp0.0Multiplyp_imConcatPIFFTr_cSlicer_reReshaperrf64[n]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference Σⱼ x[j]·x[(j + k) mod n], summed directly to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 143 float64 results inside the running error bound; the closest uses 36% of it.
  • Interpreter and NumPy backend return bit-identical results.
  • At float32 too: the 40 test cases rounded to float32, and 40 of them inside the running error bound at u = 2⁻²⁴; the closest uses 35% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
46%
largest error, in units in the last place
1.9e+8

Large ulp counts appear where a result is tiny next to the numbers it is computed from (after cancellation, for example), so one unit in the last place is tiny too; the absolute error is still inside the bound. Results within their own error of zero are not counted.

Note

The reference is the correlation sum itself, with no transform at all.

Identity

Calls
—
Called by
—
sha256:f81611b049ad6ee54bd4388f28621ace99896072a3d2fd7ac71b50e03b2ea744

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol
Ω:std.seq.circular_autocorrelation · Ω:circular_autocorrelation
Pins
sha256:47fdcf1735229540954f2e56714c2da28e765b4877f41cc185b6c4f7475b4e66this graph alone
Evidence
sha256:94158cc0c3e8a0fa576886ca2101efa175951d26587b223c3de957b0487e669athe hash of its verification record
Needs
no capability: a pure function

Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.

ΣEML 2026

Efficient New Language — a high-density semantic overlay for humans and AI agents.

This site’s demos run on the real EML toolchain, in your browser.

© 2026 EveMissLab (一言諾科技有限公司) / Neo.K. All rights reserved.