pub struct DST1ConvertToFFT<T> { /* fields omitted */ }
DST Type 1 implementation that converts the problem into a FFT of size 2 * (n + 1)
use rustdct::DST1;
use rustdct::algorithm::DST1ConvertToFFT;
use rustdct::rustfft::FFTplanner;
let len = 1234;
let mut input: Vec<f32> = vec![0f32; len];
let mut output: Vec<f32> = vec![0f32; len];
let mut planner = FFTplanner::new(false);
let fft = planner.plan_fft(2 * (len + 1));
let dct = DST1ConvertToFFT::new(fft);
dct.process_dst1(&mut input, &mut output);
Creates a new DCT1 context that will process signals of length inner_fft.len() / 2 - 1
.
Computes the DST Type 1 on the input
buffer and places the result in the output
buffer. Read more
The FFT size that this algorithm can process
🔬 This is a nightly-only experimental API. (try_from
)
The type returned in the event of a conversion error.
🔬 This is a nightly-only experimental API. (try_from
)
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
🔬 This is a nightly-only experimental API. (try_from
)
The type returned in the event of a conversion error.
🔬 This is a nightly-only experimental API. (try_from
)
🔬 This is a nightly-only experimental API. (get_type_id
)
this method will likely be replaced by an associated static