Struct RecursiveMovingAverage 

pub struct RecursiveMovingAverage<const N: usize> { /* private fields */ }

Const-generic N-point moving average filter implemented recursively (Steven W. Smith, Ch. 15, Eq. 15-3): each sample is updated with a single add and subtract, instead of an O(N) convolution sum.

Implementations

impl<const N: usize> RecursiveMovingAverage<N>

pub const fn new() -> Self

Creates a new N-point recursive moving average filter with empty history.

pub fn process(&mut self, x: f32) -> f32

Pushes a new input sample and returns the updated moving average. While fewer than N samples have been seen, the average is taken over the (growing) window received so far.

pub fn reset(&mut self)

Resets the filter to its initial, empty state.

Trait Implementations

impl<const N: usize> Clone for RecursiveMovingAverage<N>

fn clone(&self) -> RecursiveMovingAverage<N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const N: usize> Debug for RecursiveMovingAverage<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<const N: usize> Default for RecursiveMovingAverage<N>

fn default() -> Self

Returns the “default value” for a type.

impl<const N: usize> Format for RecursiveMovingAverage<N>

where CircularBuffer<f32, N>: Format,

fn format(&self, f: Formatter<'_>)

Writes the defmt representation of self to fmt.