Synthesizer.Plain.Filter.Recursive.MovingAverage

Documentation

sumsStaticInt :: C v => Int -> T v -> T v

Like Synthesizer.Plain.Filter.NonRecursive.sums but in a recursive form. This needs only linear time (independent of the window size) but may accumulate rounding errors.

ys = xs * (1,0,0,0,-1) / (1,-1)
ys * (1,-1) = xs * (1,0,0,0,-1)
ys = xs * (1,0,0,0,-1) + ys * (0,1)

modulatedFrac :: (C a, C a v) => Int -> T a -> T v -> T v