Struct rustdct::algorithm::DCT1ConvertToFFT

pub struct DCT1ConvertToFFT<T> { /* fields omitted */ }

DCT Type 1 implementation that converts the problem into a FFT of size 2 * (n - 1)

// Computes a DCT Type 1 of size 1234
use rustdct::DCT1;
use rustdct::algorithm::DCT1ConvertToFFT;
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 = DCT1ConvertToFFT::new(fft);
dct.process_dct1(&mut input, &mut output);

Implementations

impl<T: DCTnum> DCT1ConvertToFFT<T>

pub fn new(inner_fft: Arc<dyn FFT<T>>) -> Self

Creates a new DCT1 context that will process signals of length inner_fft.len() / 2 + 1.

Trait Implementations

impl<T: DCTnum> DCT1<T> for DCT1ConvertToFFT<T>

pub fn process_dct1(&self, input: &mut [T], output: &mut [T])

Computes the DCT Type 1 on the input buffer and places the result in the output buffer.

impl<T> Length for DCT1ConvertToFFT<T>

pub fn len(&self) -> usize

The FFT size that this algorithm can process