Struct LowpassState 

pub struct LowpassState<const N: usize>(pub [i64; N]);

Lowpass filter state

Tuple Fields

0: [i64; N]

Trait Implementations

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

fn clone(&self) -> LowpassState<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 LowpassState<N>

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

Formats the value using the given formatter.

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

where [i64; N]: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<const N: usize> SplitInplace<i32, LowpassState<N>> for Lowpass<N>

fn inplace(&self, state: &mut S, xy: &mut [X])

See also Inplace::inplace

impl<const N: usize> SplitProcess<i32, i32, LowpassState<N>> for Lowpass<N>

fn process(&self, state: &mut LowpassState<N>, x: i32) -> i32

The filter configuration Config contains the filter gains.

For the first-order lowpass this is a single element array [k] with the corner frequency in scaled Q31: k = pi*(1 << 31)*f0/fn where f0 is the 3dB corner frequency and fn is the Nyquist frequency. The corner frequency is warped in the usual way.

For the second-order lowpass this is [k**2/(1 << 32), -k/q] with q = 1/sqrt(2) for a Butterworth response.

In addition to the poles at the corner frequency the filters have zeros at Nyquist.

The first-order lowpass works fine and accurate for any positive gain 1 <= k <= (1 << 31) - 1. The second-order lowpass works and is accurate for 1 << 16 <= k <= q*(1 << 31).

fn block(&self, state: &mut S, x: &[X], y: &mut [Y])

Process a block of inputs