FdafAec

Struct FdafAec 

Source
pub struct FdafAec { /* private fields */ }
Expand description

Implements an Acoustic Echo Canceller using the Frequency Domain Adaptive Filter (FDAF) algorithm with the Overlap-Save method.

This struct holds the state for the AEC and processes audio in frames.

Implementations§

Source§

impl FdafAec

Source

pub fn new(fft_size: usize, step_size: f32) -> Self

Creates a new FdafAec instance.

§Arguments
  • fft_size: The size of the FFT. This determines the filter length and the trade-off between computational complexity and filter performance. A larger fft_size provides a longer filter, which can cancel more delayed echoes, but increases latency and computational cost. Must be a power of two.
  • step_size: The learning rate (mu) for the adaptive filter. It controls how fast the filter adapts. A larger value leads to faster convergence but can be less stable. A typical value is between 0.1 and 1.0.
Source

pub fn process(&mut self, far_end_frame: &[f32], mic_frame: &[f32]) -> Vec<f32>

Processes a frame of audio data to remove echo.

§Arguments
  • far_end_frame: A slice representing the audio frame from the far-end (the reference signal, e.g., loudspeaker). Its length must be fft_size / 2.
  • mic_frame: A slice representing the audio frame from the near-end microphone, containing both the near-end speaker’s voice and the echo from the far-end. Its length must be fft_size / 2.
§Returns

A Vec<f32> containing the echo-cancelled audio frame. The length of the vector is fft_size / 2.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.