Struct HbfInt

pub struct HbfInt<'a, T, const M: usize, const N: usize> { /* private fields */ }

Half band interpolator (interpolation rate 2)

The effective number of DSP taps is 4*M - 1.

M: number of taps N: state size: N = 2*M - 1 + input.len()

Implementations

impl<'a, T: Copy + Zero + Add + Mul<Output = T> + Sum, const M: usize, const N: usize> HbfInt<'a, T, M, N>

pub fn new(taps: &'a [T; M]) -> Self

Non-zero (odd) taps from oldest to one-before-center. Normalized such that center tap is 1.

pub fn buf_mut(&mut self) -> &mut [T]

Obtain a mutable reference to the input items buffer space

Trait Implementations

impl<'a, T: Clone, const M: usize, const N: usize> Clone for HbfInt<'a, T, M, N>

fn clone(&self) -> HbfInt<'a, T, M, N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, T: Debug, const M: usize, const N: usize> Debug for HbfInt<'a, T, M, N>

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

Formats the value using the given formatter.

impl<'a, T: Copy + Zero + Add + Mul<Output = T> + Sum, const M: usize, const N: usize> Filter for HbfInt<'a, T, M, N>

type Item = T

Input/output item type.

fn block_size(&self) -> (usize, usize)

Return the block size granularity and the maximum block size.

fn response_length(&self) -> usize

Finite impulse response length in numer of output items minus one Get this many to drain all previous memory

fn process_block<'b>( &mut self, x: Option<&[Self::Item]>, y: &'b mut [Self::Item], ) -> &'b mut [Self::Item]

Process a block of items.

impl<'a, T: Copy, const M: usize, const N: usize> Copy for HbfInt<'a, T, M, N>