weighted_sum()

MAYAFLUX_API double MayaFlux::Kinesis::Discrete::weighted_sum ( std::span< const double >  window, std::span< const double >  coefs  )

noexcept

Sum of window[k] * coefs[k] over the shorter of the two.

The linear case: FIR taps in a feedforward window, feedback weights in a recursive one, or the output of any generator in Coefficients.

Definition at line 98 of file Kernels.cpp.

{
    const size_t count = std::min(window.size(), coefs.size());
    const double* a = window.data();
    const double* b = coefs.data();
 
    double s0 = 0.0;
    double s1 = 0.0;
    double s2 = 0.0;
    double s3 = 0.0;
    size_t k = 0;
    for (; k + 4 <= count; k += 4) {
        s0 += a[k] * b[k];
        s1 += a[k + 1] * b[k + 1];
        s2 += a[k + 2] * b[k + 2];
        s3 += a[k + 3] * b[k + 3];
    }
 
    double tail = 0.0;
    for (; k < count; ++k)
        tail += a[k] * b[k];
    return ((s0 + s1) + (s2 + s3)) + tail;
}

References a, b, count, and window.

Referenced by lotka_volterra_step(), modular_recurrence(), and rotor_bank().

Here is the caller graph for this function: